Krzysztof Z Pietrzak

Pietrzak Group

102 Publications

Mark all

[102]
2023 | Conference Paper | IST-REx-ID: 13143 | OA
Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[101]
2023 | Conference Paper | IST-REx-ID: 14428 | OA
Dodis, Yevgeniy, et al. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.” 43rd Annual International Cryptology Conference, vol. 14082, Springer Nature, 2023, pp. 514–46, doi:10.1007/978-3-031-38545-2_17.
[Preprint] View | DOI | Download Preprint (ext.)
 
[100]
2023 | Conference Paper | IST-REx-ID: 14691 | OA
Auerbach, Benedikt, et al. “On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement.” 21st International Conference on Theory of Cryptography, vol. 14371, Springer Nature, 2023, pp. 271–300, doi:10.1007/978-3-031-48621-0_10.
[Preprint] View | DOI | Download Preprint (ext.)
 
[99]
2022 | Conference Paper | IST-REx-ID: 11476 | OA
Alwen, Joël, et al. “CoCoA: Concurrent Continuous Group Key Agreement.” Advances in Cryptology – EUROCRYPT 2022, vol. 13276, Springer Nature, 2022, pp. 815–844, doi:10.1007/978-3-031-07085-3_28.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[98]
2022 | Conference Paper | IST-REx-ID: 12167 | OA
Avarikioti, Georgia, et al. “Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.” Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 358–73, doi:10.1007/978-3-031-18283-9_17.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[97]
2022 | Conference Paper | IST-REx-ID: 12176 | OA
Hoffmann, Charlotte, et al. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.” Advances in Cryptology – CRYPTO 2022, vol. 13508, Springer Nature, 2022, pp. 370–99, doi:10.1007/978-3-031-15979-4_13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[96]
2021 | Conference Paper | IST-REx-ID: 9826 | OA
Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:10.1007/978-3-030-75539-3_17.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[95]
2021 | Conference Paper | IST-REx-ID: 10407 | OA
Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[94]
2021 | Conference Paper | IST-REx-ID: 10408 | OA
Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[93]
2021 | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[92]
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[91]
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[90]
2021 | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[89]
2021 | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[88]
2021 | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[87]
2021 | Conference Paper | IST-REx-ID: 9969 | OA
Pietrzak, Krzysztof Z., et al. LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. IEEE, 2021, doi:10.23919/IFIPNetworking52078.2021.9472205.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[86]
2020 | Conference Paper | IST-REx-ID: 8987 | OA
Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” Progress in Cryptology, vol. 12578, Springer Nature, 2020, pp. 3–15, doi:10.1007/978-3-030-65277-7_1.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[85]
2019 | Conference Paper | IST-REx-ID: 6528 | OA
Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[84]
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[83]
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[82]
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol. 11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[81]
2018 | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[80]
2018 | Journal Article | IST-REx-ID: 107 | OA
Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM, vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[79]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[78]
2018 | Conference Paper | IST-REx-ID: 302 | OA
Cohen, Bram, and Krzysztof Z. Pietrzak. Simple Proofs of Sequential Work. Vol. 10821, Springer, 2018, pp. 451–67, doi:10.1007/978-3-319-78375-8_15.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[77]
2018 | Conference Paper | IST-REx-ID: 298 | OA
Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer, 2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[76]
2018 | Conference Paper | IST-REx-ID: 6941 | OA
Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[75]
2017 | Conference Paper | IST-REx-ID: 605 | OA
Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 635 | OA
Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 640 | OA
Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[72]
2017 | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
[Published Version] View | Files available | DOI
 
[71]
2017 | Journal Article | IST-REx-ID: 6196 | OA
Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.
[Published Version] View | Files available | DOI
 
[70]
2017 | Conference Paper | IST-REx-ID: 559 | OA
Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[68]
2017 | Journal Article | IST-REx-ID: 1187 | OA
Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3.
[Submitted Version] View | Files available | DOI | WoS
 
[67]
2016 | Conference Paper | IST-REx-ID: 1179 | OA
Pietrzak, Krzysztof Z., and Skorski Maciej. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. Vol. 9985, Springer, 2016, pp. 183–203, doi:10.1007/978-3-662-53641-4_8.
[Preprint] View | DOI | Download Preprint (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[65]
2016 | Conference Paper | IST-REx-ID: 1233 | OA
Fuchsbauer, Georg, et al. Standard Security Does Imply Security against Selective Opening for Markov Distributions. Vol. 9562, Springer, 2016, pp. 282–305, doi:10.1007/978-3-662-49096-9_12.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[64]
2016 | Conference Paper | IST-REx-ID: 1653 | OA
Okamoto, Tatsuaki, et al. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. Vol. 9452, Springer, 2016, pp. 121–45, doi:10.1007/978-3-662-48797-6_6.
[Submitted Version] View | Files available | DOI
 
[63]
2016 | Journal Article | IST-REx-ID: 1479 | OA
Krenn, Stephan, et al. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” Computational Complexity, vol. 25, no. 3, Springer, 2016, pp. 567–605, doi:10.1007/s00037-015-0120-9.
[Submitted Version] View | Files available | DOI
 
[62]
2016 | Conference Paper | IST-REx-ID: 1229 | OA
Abusalah, Hamza M., et al. Offline Witness Encryption. Vol. 9696, Springer, 2016, pp. 285–303, doi:10.1007/978-3-319-39555-5_16.
[Submitted Version] View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1236 | OA
Abusalah, Hamza M., et al. Constrained PRFs for Unbounded Inputs. Vol. 9610, Springer, 2016, pp. 413–28, doi:10.1007/978-3-319-29485-8_24.
[Submitted Version] View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1646 | OA
Banerjee, Abishek, et al. “Key-Homomorphic Constrained Pseudorandom Functions.” 12th Theory of Cryptography Conference, vol. 9015, Springer Nature, 2015, pp. 31–60, doi:10.1007/978-3-662-46497-7_2.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648 | OA
Fuchsbauer, Georg, et al. A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. Vol. 9215, Springer, 2015, pp. 601–20, doi:10.1007/978-3-662-47989-6_29.
[Submitted Version] View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1649 | OA
Benhamouda, Fabrice, et al. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. Vol. 9326, Springer, 2015, pp. 305–25, doi:10.1007/978-3-319-24174-6_16.
[Published Version] View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1654 | OA
Gazi, Peter, et al. Generic Security of NMAC and HMAC with Input Whitening. Vol. 9453, Springer, 2015, pp. 85–109, doi:10.1007/978-3-662-48800-3_4.
[Submitted Version] View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1650 | OA
Skórski, Maciej, et al. Condensed Unpredictability . Vol. 9134, Springer, 2015, pp. 1046–57, doi:10.1007/978-3-662-47672-7_85.
[Published Version] View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669 | OA
Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy, Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.
[Submitted Version] View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671 | OA
Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87, doi:10.1007/978-3-662-47989-6_18.
[Submitted Version] View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1675 | OA
Dziembowski, Stefan, et al. “Proofs of Space.” 35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[52]
2014 | Conference Paper | IST-REx-ID: 1927 | OA
Fuchsbauer, Georg, et al. Adaptive Security of Constrained PRFs. Vol. 8874, Springer, 2014, pp. 173–92, doi:10.1145/2591796.2591825.
View | DOI | Download (ext.)
 
[51]
2014 | Conference Paper | IST-REx-ID: 2185 | OA
Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.
[Submitted Version] View | Files available | DOI
 
[50]
2014 | Conference Paper | IST-REx-ID: 2219 | OA
Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN. Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[49]
2014 | Conference Paper | IST-REx-ID: 2236 | OA
Jetchev, Dimitar, and Krzysztof Z. Pietrzak. How to Fake Auxiliary Input. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:10.1007/978-3-642-54242-8_24.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2082 | OA
Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:10.1007/978-3-662-44371-2_7.
[Submitted Version] View | Files available | DOI
 
[46]
2013 | Conference Paper | IST-REx-ID: 2259 | OA
Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.
[Published Version] View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2258 | OA
Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.
[Submitted Version] View | Files available | DOI
 
[44]
2013 | Conference Paper | IST-REx-ID: 2940 | OA
Krenn, Stephan, et al. A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:10.1007/978-3-642-36594-2_2.
[Submitted Version] View | Files available | DOI
 
[43]
2013 | Report | IST-REx-ID: 2274 | OA
Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
[Published Version] View | Files available
 
[42]
2012 | Conference Paper | IST-REx-ID: 2048 | OA
Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” Conference Proceedings CHES 2012, vol. 7428, Springer, 2012, pp. 213–32, doi:10.1007/978-3-642-33027-8_13.
[Preprint] View | DOI | Download Preprint (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2049 | OA
Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” Conference Proceedings FSE 2012, vol. 7549, Springer, 2012, pp. 346–65, doi:10.1007/978-3-642-34047-5_20.
[Preprint] View | DOI | Download Preprint (ext.)
 
[40]
2012 | Conference Paper | IST-REx-ID: 2974 | OA
Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.
[Submitted Version] View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” Journal of Cryptology, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:10.1007/s00145-010-9090-x.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3250
Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise. Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9.
View | DOI
 
[37]
2012 | Conference Paper | IST-REx-ID: 3282 | OA
Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237, Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22.
[Submitted Version] View | Files available | DOI
 
[36]
2012 | Conference Paper | IST-REx-ID: 3280 | OA
Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp. 548–63, doi:10.1007/978-3-642-28914-9_31.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[35]
2012 | Conference Paper | IST-REx-ID: 3281
Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well. Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.
View | DOI | Download None (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3279
Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.
View | DOI | Download None (ext.)
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
Barak, Boaz, et al. Leftover Hash Lemma Revisited. Vol. 6841, Springer, 2011, pp. 1–20, doi: 10.1007/978-3-642-22792-9_1.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3239
Faust, Sebastian, et al. Tamper Proof Circuits How to Trade Leakage for Tamper Resilience. Vol. 6755, no. Part 1, Springer, 2011, pp. 391–402, doi:10.1007/978-3-642-22006-7_33.
View | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3236
Jain, Abhishek, and Krzysztof Z. Pietrzak. Parallel Repetition for Leakage Resilience Amplification Revisited. Vol. 6597, Springer, 2011, pp. 58–69, doi:10.1007/978-3-642-19571-6_5.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3238
Kiltz, Eike, et al. Efficient Authentication from Hard Learning Problems. Vol. 6632, Springer, 2011, pp. 7–26, doi:10.1007/978-3-642-20465-4_3.
View | Files available | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
Kiltz, Eike, and Krzysztof Z. Pietrzak. Leakage Resilient ElGamal Encryption. Vol. 6477, Springer, 2010, pp. 595–612, doi:10.1007/978-3-642-17373-8_34.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3235
Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. Leakage Resilient Pseudorandom Functions and Side Channel Attacks on Feistel Networks. Vol. 6223, Springer, 2010, pp. 21–40, doi:10.1007/978-3-642-14623-7_2.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
Faust, Sebastian, et al. Leakage Resilient Signatures. Vol. 5978, Springer, 2010, pp. 343–60, doi:10.1007/978-3-642-11799-2_21.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3233
Håstad, Johan, et al. An Efficient Parallel Repetition Theorem. Vol. 5978, Springer, 2010, pp. 1–18, doi:10.1007/978-3-642-11799-2_1.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3230
Kiltz, Eike, et al. A New Randomness Extraction Paradigm for Hybrid Encryption. Vol. 5479, Springer, 2009, pp. 590–609, doi:10.1007/978-3-642-01001-9_34.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3231
Kiltz, Eike, and Krzysztof Z. Pietrzak. On the Security of Padding Based Encryption Schemes Why We Cannot Prove OAEP Secure in the Standard Model. Vol. 5479, Springer, 2009, pp. 389–406, doi:10.1007/978-3-642-01001-9_23.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3232
Pietrzak, Krzysztof Z. A Leakage Resilient Mode of Operation. Vol. 5479, Springer, 2009, pp. 462–82, doi:10.1007/978-3-642-01001-9_27.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3226
Pietrzak, Krzysztof Z., and Johan Sjödin. Weak Pseudorandom Functions in Minicrypt. Vol. 5126, no. PART 2, Springer, 2008, pp. 423–36, doi:10.1007/978-3-540-70583-3_35.
View | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3228
Pietrzak, Krzysztof Z. Compression from Collisions or Why CRHF Combiners Have a Long Output. Vol. 5157, Springer, 2008, pp. 413–32, doi:10.1007/978-3-540-85174-5_23.
View | DOI
 
[20]
2008 | Conference Paper | IST-REx-ID: 3229
Dziembowski, Stefan, and Krzysztof Z. Pietrzak. Leakage Resilient Cryptography. IEEE, 2008, pp. 293–302, doi:10.1109/FOCS.2008.56.
View | DOI
 
[19]
2008 | Journal Article | IST-REx-ID: 3227
Zubielik, Piotr, et al. “Elektrowiz – System of Measurement Data Management.” Przeglad Elektrotechniczny, vol. 84, no. 10, SIGMA-NOT, 2008, pp. 239–42.
View | Download (ext.)
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
Dodis, Yevgeniy, et al. A New Mode of Operation for Block Ciphers and Length Preserving MACs. Vol. 4965, Springer, 2008, pp. 198–219, doi:10.1007/978-3-540-78967-3_12.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3225
Fischlin, Marc, et al. Robust Multi Property Combiners for Hash Functions Revisited. Vol. 5126, no. PART 2, Springer, 2008, pp. 655–66, doi:10.1007/978-3-540-70583-3_53.
View | Files available | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
Pietrzak, Krzysztof Z. Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist. Vol. 4515, Springer, 2007, pp. 23–33, doi:10.1007/978-3-540-72540-4_2.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3223
Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. Improving the Security of MACs via Randomized Message Preprocessing. Vol. 4593, Springer, 2007, pp. 414–33, doi:10.1007/978-3-540-74619-5_26.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3222
Pietrzak, Krzysztof Z., and Douglas Wikström. Parallel Repetition of Computationally Sound Protocols Revisited. Vol. 4392, Springer, 2007, pp. 86–102, doi:10.1007/978-3-540-70936-7_5.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3220
Dziembowski, Stefan, and Krzysztof Z. Pietrzak. Intrusion Resilient Secret Sharing. IEEE, 2007, pp. 227–37, doi:10.1109/FOCS.2007.63.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3219
Maurer, Ueli, et al. Indistinguishability Amplification. Vol. 4622, Springer, 2007, pp. 130–49, doi:10.1007/978-3-540-74143-5_8.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3221
Pietrzak, Krzysztof Z., and Johan Sjödin. Range Extension for Weak PRFs the Good the Bad and the Ugly. Vol. 4515, Springer, 2007, pp. 517–33, doi:10.1007/978-3-540-72540-4_30.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
Maurer, Ueli, et al. Luby Rackoff Ciphers from Weak Round Functions . Vol. 4004, Springer, 2006, pp. 391–408, doi:10.1007/11761679_24.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Dodis, Yevgeniy, et al. Separating Sources for Encryption and Secret Sharing. Vol. 3876, Springer, 2006, pp. 601–16, doi:10.1007/11681878_31.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3217
Pietrzak, Krzysztof Z. Composition Implies Adaptive Security in Minicrypt. Vol. 4004, Springer, 2006, pp. 328–38, doi:10.1007/11761679_20.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3216
Pietrzak, Krzysztof Z. A Tight Bound for EMAC. Vol. 4052, Springer, 2006, pp. 168–79, doi:10.1007/11787006_15.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3212
Dodis, Yevgeniy, et al. On the Generic Insecurity of the Full Domain Hash. Vol. 3621, Springer, 2005, pp. 449–66, doi:10.1007/11535218_27.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3213
Pietrzak, Krzysztof Z. Composition Does Not Imply Adaptive Security. Vol. 3621, Springer, 2005, pp. 55–65, doi:10.1007/11535218_4.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3211
Bellare, Mihir, et al. Improved Security Analyses for CBC MACs. Vol. 3621, Springer, 2005, pp. 527–45, doi:10.1007/11535218_32.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
Maurer, Ueli, and Krzysztof Z. Pietrzak. Composition of Random Systems: When Two Weak Make One Strong. Vol. 2951, Springer, 2004, pp. 410–27, doi:10.1007/978-3-540-24638-1_23.
View | DOI
 
[2]
2003 | Journal Article | IST-REx-ID: 3209
Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal of Computer and System Sciences, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:10.1016/S0022-0000(03)00078-3.
View | DOI
 
[1]
2003 | Conference Paper | IST-REx-ID: 3210
Maurer, Ueli, and Krzysztof Z. Pietrzak. The Security of Many Round Luby Rackoff Pseudo Random Permutations. Vol. 2656, Springer, 2003, pp. 544–61, doi:10.1007/3-540-39200-9_34.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: MLA

    Export / Embed

102 Publications

Mark all

[102]
2023 | Conference Paper | IST-REx-ID: 13143 | OA
Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[101]
2023 | Conference Paper | IST-REx-ID: 14428 | OA
Dodis, Yevgeniy, et al. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.” 43rd Annual International Cryptology Conference, vol. 14082, Springer Nature, 2023, pp. 514–46, doi:10.1007/978-3-031-38545-2_17.
[Preprint] View | DOI | Download Preprint (ext.)
 
[100]
2023 | Conference Paper | IST-REx-ID: 14691 | OA
Auerbach, Benedikt, et al. “On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement.” 21st International Conference on Theory of Cryptography, vol. 14371, Springer Nature, 2023, pp. 271–300, doi:10.1007/978-3-031-48621-0_10.
[Preprint] View | DOI | Download Preprint (ext.)
 
[99]
2022 | Conference Paper | IST-REx-ID: 11476 | OA
Alwen, Joël, et al. “CoCoA: Concurrent Continuous Group Key Agreement.” Advances in Cryptology – EUROCRYPT 2022, vol. 13276, Springer Nature, 2022, pp. 815–844, doi:10.1007/978-3-031-07085-3_28.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[98]
2022 | Conference Paper | IST-REx-ID: 12167 | OA
Avarikioti, Georgia, et al. “Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.” Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 358–73, doi:10.1007/978-3-031-18283-9_17.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[97]
2022 | Conference Paper | IST-REx-ID: 12176 | OA
Hoffmann, Charlotte, et al. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.” Advances in Cryptology – CRYPTO 2022, vol. 13508, Springer Nature, 2022, pp. 370–99, doi:10.1007/978-3-031-15979-4_13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[96]
2021 | Conference Paper | IST-REx-ID: 9826 | OA
Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:10.1007/978-3-030-75539-3_17.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[95]
2021 | Conference Paper | IST-REx-ID: 10407 | OA
Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[94]
2021 | Conference Paper | IST-REx-ID: 10408 | OA
Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[93]
2021 | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[92]
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[91]
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[90]
2021 | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[89]
2021 | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[88]
2021 | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[87]
2021 | Conference Paper | IST-REx-ID: 9969 | OA
Pietrzak, Krzysztof Z., et al. LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. IEEE, 2021, doi:10.23919/IFIPNetworking52078.2021.9472205.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[86]
2020 | Conference Paper | IST-REx-ID: 8987 | OA
Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” Progress in Cryptology, vol. 12578, Springer Nature, 2020, pp. 3–15, doi:10.1007/978-3-030-65277-7_1.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[85]
2019 | Conference Paper | IST-REx-ID: 6528 | OA
Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[84]
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[83]
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[82]
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol. 11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[81]
2018 | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[80]
2018 | Journal Article | IST-REx-ID: 107 | OA
Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM, vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[79]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[78]
2018 | Conference Paper | IST-REx-ID: 302 | OA
Cohen, Bram, and Krzysztof Z. Pietrzak. Simple Proofs of Sequential Work. Vol. 10821, Springer, 2018, pp. 451–67, doi:10.1007/978-3-319-78375-8_15.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[77]
2018 | Conference Paper | IST-REx-ID: 298 | OA
Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer, 2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[76]
2018 | Conference Paper | IST-REx-ID: 6941 | OA
Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[75]
2017 | Conference Paper | IST-REx-ID: 605 | OA
Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 635 | OA
Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 640 | OA
Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[72]
2017 | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
[Published Version] View | Files available | DOI
 
[71]
2017 | Journal Article | IST-REx-ID: 6196 | OA
Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.
[Published Version] View | Files available | DOI
 
[70]
2017 | Conference Paper | IST-REx-ID: 559 | OA
Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[68]
2017 | Journal Article | IST-REx-ID: 1187 | OA
Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3.
[Submitted Version] View | Files available | DOI | WoS
 
[67]
2016 | Conference Paper | IST-REx-ID: 1179 | OA
Pietrzak, Krzysztof Z., and Skorski Maciej. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. Vol. 9985, Springer, 2016, pp. 183–203, doi:10.1007/978-3-662-53641-4_8.
[Preprint] View | DOI | Download Preprint (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[65]
2016 | Conference Paper | IST-REx-ID: 1233 | OA
Fuchsbauer, Georg, et al. Standard Security Does Imply Security against Selective Opening for Markov Distributions. Vol. 9562, Springer, 2016, pp. 282–305, doi:10.1007/978-3-662-49096-9_12.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[64]
2016 | Conference Paper | IST-REx-ID: 1653 | OA
Okamoto, Tatsuaki, et al. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. Vol. 9452, Springer, 2016, pp. 121–45, doi:10.1007/978-3-662-48797-6_6.
[Submitted Version] View | Files available | DOI
 
[63]
2016 | Journal Article | IST-REx-ID: 1479 | OA
Krenn, Stephan, et al. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” Computational Complexity, vol. 25, no. 3, Springer, 2016, pp. 567–605, doi:10.1007/s00037-015-0120-9.
[Submitted Version] View | Files available | DOI
 
[62]
2016 | Conference Paper | IST-REx-ID: 1229 | OA
Abusalah, Hamza M., et al. Offline Witness Encryption. Vol. 9696, Springer, 2016, pp. 285–303, doi:10.1007/978-3-319-39555-5_16.
[Submitted Version] View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1236 | OA
Abusalah, Hamza M., et al. Constrained PRFs for Unbounded Inputs. Vol. 9610, Springer, 2016, pp. 413–28, doi:10.1007/978-3-319-29485-8_24.
[Submitted Version] View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1646 | OA
Banerjee, Abishek, et al. “Key-Homomorphic Constrained Pseudorandom Functions.” 12th Theory of Cryptography Conference, vol. 9015, Springer Nature, 2015, pp. 31–60, doi:10.1007/978-3-662-46497-7_2.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648 | OA
Fuchsbauer, Georg, et al. A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. Vol. 9215, Springer, 2015, pp. 601–20, doi:10.1007/978-3-662-47989-6_29.
[Submitted Version] View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1649 | OA
Benhamouda, Fabrice, et al. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. Vol. 9326, Springer, 2015, pp. 305–25, doi:10.1007/978-3-319-24174-6_16.
[Published Version] View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1654 | OA
Gazi, Peter, et al. Generic Security of NMAC and HMAC with Input Whitening. Vol. 9453, Springer, 2015, pp. 85–109, doi:10.1007/978-3-662-48800-3_4.
[Submitted Version] View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1650 | OA
Skórski, Maciej, et al. Condensed Unpredictability . Vol. 9134, Springer, 2015, pp. 1046–57, doi:10.1007/978-3-662-47672-7_85.
[Published Version] View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669 | OA
Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy, Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.
[Submitted Version] View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671 | OA
Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87, doi:10.1007/978-3-662-47989-6_18.
[Submitted Version] View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1675 | OA
Dziembowski, Stefan, et al. “Proofs of Space.” 35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[52]
2014 | Conference Paper | IST-REx-ID: 1927 | OA
Fuchsbauer, Georg, et al. Adaptive Security of Constrained PRFs. Vol. 8874, Springer, 2014, pp. 173–92, doi:10.1145/2591796.2591825.
View | DOI | Download (ext.)
 
[51]
2014 | Conference Paper | IST-REx-ID: 2185 | OA
Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.
[Submitted Version] View | Files available | DOI
 
[50]
2014 | Conference Paper | IST-REx-ID: 2219 | OA
Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN. Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[49]
2014 | Conference Paper | IST-REx-ID: 2236 | OA
Jetchev, Dimitar, and Krzysztof Z. Pietrzak. How to Fake Auxiliary Input. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:10.1007/978-3-642-54242-8_24.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2082 | OA
Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:10.1007/978-3-662-44371-2_7.
[Submitted Version] View | Files available | DOI
 
[46]
2013 | Conference Paper | IST-REx-ID: 2259 | OA
Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.
[Published Version] View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2258 | OA
Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.
[Submitted Version] View | Files available | DOI
 
[44]
2013 | Conference Paper | IST-REx-ID: 2940 | OA
Krenn, Stephan, et al. A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:10.1007/978-3-642-36594-2_2.
[Submitted Version] View | Files available | DOI
 
[43]
2013 | Report | IST-REx-ID: 2274 | OA
Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
[Published Version] View | Files available
 
[42]
2012 | Conference Paper | IST-REx-ID: 2048 | OA
Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” Conference Proceedings CHES 2012, vol. 7428, Springer, 2012, pp. 213–32, doi:10.1007/978-3-642-33027-8_13.
[Preprint] View | DOI | Download Preprint (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2049 | OA
Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” Conference Proceedings FSE 2012, vol. 7549, Springer, 2012, pp. 346–65, doi:10.1007/978-3-642-34047-5_20.
[Preprint] View | DOI | Download Preprint (ext.)
 
[40]
2012 | Conference Paper | IST-REx-ID: 2974 | OA
Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.
[Submitted Version] View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” Journal of Cryptology, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:10.1007/s00145-010-9090-x.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3250
Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise. Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9.
View | DOI
 
[37]
2012 | Conference Paper | IST-REx-ID: 3282 | OA
Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237, Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22.
[Submitted Version] View | Files available | DOI
 
[36]
2012 | Conference Paper | IST-REx-ID: 3280 | OA
Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp. 548–63, doi:10.1007/978-3-642-28914-9_31.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[35]
2012 | Conference Paper | IST-REx-ID: 3281
Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well. Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.
View | DOI | Download None (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3279
Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.
View | DOI | Download None (ext.)
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
Barak, Boaz, et al. Leftover Hash Lemma Revisited. Vol. 6841, Springer, 2011, pp. 1–20, doi: 10.1007/978-3-642-22792-9_1.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3239
Faust, Sebastian, et al. Tamper Proof Circuits How to Trade Leakage for Tamper Resilience. Vol. 6755, no. Part 1, Springer, 2011, pp. 391–402, doi:10.1007/978-3-642-22006-7_33.
View | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3236
Jain, Abhishek, and Krzysztof Z. Pietrzak. Parallel Repetition for Leakage Resilience Amplification Revisited. Vol. 6597, Springer, 2011, pp. 58–69, doi:10.1007/978-3-642-19571-6_5.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3238
Kiltz, Eike, et al. Efficient Authentication from Hard Learning Problems. Vol. 6632, Springer, 2011, pp. 7–26, doi:10.1007/978-3-642-20465-4_3.
View | Files available | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
Kiltz, Eike, and Krzysztof Z. Pietrzak. Leakage Resilient ElGamal Encryption. Vol. 6477, Springer, 2010, pp. 595–612, doi:10.1007/978-3-642-17373-8_34.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3235
Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. Leakage Resilient Pseudorandom Functions and Side Channel Attacks on Feistel Networks. Vol. 6223, Springer, 2010, pp. 21–40, doi:10.1007/978-3-642-14623-7_2.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
Faust, Sebastian, et al. Leakage Resilient Signatures. Vol. 5978, Springer, 2010, pp. 343–60, doi:10.1007/978-3-642-11799-2_21.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3233
Håstad, Johan, et al. An Efficient Parallel Repetition Theorem. Vol. 5978, Springer, 2010, pp. 1–18, doi:10.1007/978-3-642-11799-2_1.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3230
Kiltz, Eike, et al. A New Randomness Extraction Paradigm for Hybrid Encryption. Vol. 5479, Springer, 2009, pp. 590–609, doi:10.1007/978-3-642-01001-9_34.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3231
Kiltz, Eike, and Krzysztof Z. Pietrzak. On the Security of Padding Based Encryption Schemes Why We Cannot Prove OAEP Secure in the Standard Model. Vol. 5479, Springer, 2009, pp. 389–406, doi:10.1007/978-3-642-01001-9_23.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3232
Pietrzak, Krzysztof Z. A Leakage Resilient Mode of Operation. Vol. 5479, Springer, 2009, pp. 462–82, doi:10.1007/978-3-642-01001-9_27.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3226
Pietrzak, Krzysztof Z., and Johan Sjödin. Weak Pseudorandom Functions in Minicrypt. Vol. 5126, no. PART 2, Springer, 2008, pp. 423–36, doi:10.1007/978-3-540-70583-3_35.
View | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3228
Pietrzak, Krzysztof Z. Compression from Collisions or Why CRHF Combiners Have a Long Output. Vol. 5157, Springer, 2008, pp. 413–32, doi:10.1007/978-3-540-85174-5_23.
View | DOI
 
[20]
2008 | Conference Paper | IST-REx-ID: 3229
Dziembowski, Stefan, and Krzysztof Z. Pietrzak. Leakage Resilient Cryptography. IEEE, 2008, pp. 293–302, doi:10.1109/FOCS.2008.56.
View | DOI
 
[19]
2008 | Journal Article | IST-REx-ID: 3227
Zubielik, Piotr, et al. “Elektrowiz – System of Measurement Data Management.” Przeglad Elektrotechniczny, vol. 84, no. 10, SIGMA-NOT, 2008, pp. 239–42.
View | Download (ext.)
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
Dodis, Yevgeniy, et al. A New Mode of Operation for Block Ciphers and Length Preserving MACs. Vol. 4965, Springer, 2008, pp. 198–219, doi:10.1007/978-3-540-78967-3_12.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3225
Fischlin, Marc, et al. Robust Multi Property Combiners for Hash Functions Revisited. Vol. 5126, no. PART 2, Springer, 2008, pp. 655–66, doi:10.1007/978-3-540-70583-3_53.
View | Files available | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
Pietrzak, Krzysztof Z. Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist. Vol. 4515, Springer, 2007, pp. 23–33, doi:10.1007/978-3-540-72540-4_2.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3223
Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. Improving the Security of MACs via Randomized Message Preprocessing. Vol. 4593, Springer, 2007, pp. 414–33, doi:10.1007/978-3-540-74619-5_26.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3222
Pietrzak, Krzysztof Z., and Douglas Wikström. Parallel Repetition of Computationally Sound Protocols Revisited. Vol. 4392, Springer, 2007, pp. 86–102, doi:10.1007/978-3-540-70936-7_5.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3220
Dziembowski, Stefan, and Krzysztof Z. Pietrzak. Intrusion Resilient Secret Sharing. IEEE, 2007, pp. 227–37, doi:10.1109/FOCS.2007.63.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3219
Maurer, Ueli, et al. Indistinguishability Amplification. Vol. 4622, Springer, 2007, pp. 130–49, doi:10.1007/978-3-540-74143-5_8.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3221
Pietrzak, Krzysztof Z., and Johan Sjödin. Range Extension for Weak PRFs the Good the Bad and the Ugly. Vol. 4515, Springer, 2007, pp. 517–33, doi:10.1007/978-3-540-72540-4_30.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
Maurer, Ueli, et al. Luby Rackoff Ciphers from Weak Round Functions . Vol. 4004, Springer, 2006, pp. 391–408, doi:10.1007/11761679_24.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Dodis, Yevgeniy, et al. Separating Sources for Encryption and Secret Sharing. Vol. 3876, Springer, 2006, pp. 601–16, doi:10.1007/11681878_31.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3217
Pietrzak, Krzysztof Z. Composition Implies Adaptive Security in Minicrypt. Vol. 4004, Springer, 2006, pp. 328–38, doi:10.1007/11761679_20.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3216
Pietrzak, Krzysztof Z. A Tight Bound for EMAC. Vol. 4052, Springer, 2006, pp. 168–79, doi:10.1007/11787006_15.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3212
Dodis, Yevgeniy, et al. On the Generic Insecurity of the Full Domain Hash. Vol. 3621, Springer, 2005, pp. 449–66, doi:10.1007/11535218_27.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3213
Pietrzak, Krzysztof Z. Composition Does Not Imply Adaptive Security. Vol. 3621, Springer, 2005, pp. 55–65, doi:10.1007/11535218_4.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3211
Bellare, Mihir, et al. Improved Security Analyses for CBC MACs. Vol. 3621, Springer, 2005, pp. 527–45, doi:10.1007/11535218_32.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
Maurer, Ueli, and Krzysztof Z. Pietrzak. Composition of Random Systems: When Two Weak Make One Strong. Vol. 2951, Springer, 2004, pp. 410–27, doi:10.1007/978-3-540-24638-1_23.
View | DOI
 
[2]
2003 | Journal Article | IST-REx-ID: 3209
Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal of Computer and System Sciences, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:10.1016/S0022-0000(03)00078-3.
View | DOI
 
[1]
2003 | Conference Paper | IST-REx-ID: 3210
Maurer, Ueli, and Krzysztof Z. Pietrzak. The Security of Many Round Luby Rackoff Pseudo Random Permutations. Vol. 2656, Springer, 2003, pp. 544–61, doi:10.1007/3-540-39200-9_34.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: MLA

    Export / Embed