default search action
Krzysztof Pietrzak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j8]Christoph U. Günther, Krzysztof Pietrzak:
Deniability in Automated Contact Tracing: Impossibilities and Possibilities. Proc. Priv. Enhancing Technol. 2024(4): 636-648 (2024) - [c98]Benedikt Auerbach
, Christoph U. Günther
Trapdoor Memory-Hard Functions. EUROCRYPT (3) 2024: 315-344 - [c97]Krishnendu Chatterjee
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. PODC 2024: 268-278 - [c96]Michael Anastos
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. TCC (1) 2024: 413-443 - [i82]Krishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic:
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. CoRR abs/2405.04420 (2024) - [i81]Benedikt Auerbach, Christoph U. Günther, Krzysztof Pietrzak:
Trapdoor Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2024: 312 (2024) - [i80]Charlotte Hoffmann, Krzysztof Pietrzak:
Watermarkable and Zero-Knowledge Verifiable Delay Functions from any Proof of Exponentiation. IACR Cryptol. ePrint Arch. 2024: 481 (2024) - [i79]Krishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic:
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. IACR Cryptol. ePrint Arch. 2024: 704 (2024) - [i78]Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak:
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. IACR Cryptol. ePrint Arch. 2024: 1097 (2024) - 2023
- [c95]Yevgeniy Dodis, Niels Ferguson, Eli Goldin, Peter Hall, Krzysztof Pietrzak:
Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance. CRYPTO (2) 2023: 514-546 - [c94]Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak:
Efficiently Testable Circuits. ITCS 2023: 10:1-10:23 - [c93]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath
Certifying Giant Nonprimes. Public Key Cryptography (1) 2023: 530-553 - [c92]Mirza Ahad Baig
Efficiently Testable Circuits Without Conductivity. TCC (3) 2023: 123-152 - [c91]Benedikt Auerbach
On the Cost of Post-compromise Security in Concurrent Continuous Group-Key Agreement. TCC (3) 2023: 271-300 - [i77]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak:
Certifying Giant Nonprimes. IACR Cryptol. ePrint Arch. 2023: 238 (2023) - [i76]Yevgeniy Dodis, Niels Ferguson, Eli Goldin, Peter Hall, Krzysztof Pietrzak:
Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance. IACR Cryptol. ePrint Arch. 2023: 1041 (2023) - [i75]Benedikt Auerbach
On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement. IACR Cryptol. ePrint Arch. 2023: 1123 (2023) - [i74]Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak:
Efficiently Testable Circuits without Conductivity. IACR Cryptol. ePrint Arch. 2023: 1795 (2023) - 2022
- [c90]Samarth Tiwari
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation. AFT 2022: 217-231 - [c89]Charlotte Hoffmann
Practical Statistically-Sound Proofs of Exponentiation in Any Group. CRYPTO (2) 2022: 370-399 - [c88]Joël Alwen, Benedikt Auerbach
CoCoA: Concurrent Continuous Group Key Agreement. EUROCRYPT (2) 2022: 815-844 - [c87]Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem, Stefan Schmid
Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks. Financial Cryptography 2022: 358-373 - [i73]Samarth Tiwari, Michelle Yeo, Zeta Avarikioti, Iosif Salem
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation. CoRR abs/2205.11597 (2022) - [i72]Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
CoCoA: Concurrent Continuous Group Key Agreement. IACR Cryptol. ePrint Arch. 2022: 251 (2022) - [i71]Joël Alwen, Benedikt Auerbach
Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging. IACR Cryptol. ePrint Arch. 2022: 559 (2022) - [i70]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Practical Statistically-Sound Proofs of Exponentiation in any Group. IACR Cryptol. ePrint Arch. 2022: 1021 (2022) - [i69]Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak:
Efficiently Testable Circuits. IACR Cryptol. ePrint Arch. 2022: 1598 (2022) - 2021
- [c86]Chethan Kamath
Limits on the Adaptive Security of Yao's Garbling. CRYPTO (2) 2021: 486-515 - [c85]Benedikt Auerbach
Inverse-Sybil Attacks in Automated Contact Tracing. CT-RSA 2021: 399-421 - [c84]Krzysztof Pietrzak, Iosif Salem
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. Networking 2021: 1-9 - [c83]Karen Klein
Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement. SP 2021: 268-284 - [c82]Joël Alwen, Benedikt Auerbach
Grafting Key Trees: Efficient Key Management for Overlapping Groups. TCC (3) 2021: 222-253 - [c81]Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak, Michelle Yeo
Trojan-Resilience Without Cryptography. TCC (2) 2021: 397-428 - [c80]Chethan Kamath
On Treewidth, Separators and Yao's Garbling. TCC (2) 2021: 486-517 - [c79]Chethan Kamath
The Cost of Adaptivity in Security Games on Graphs. TCC (2) 2021: 550-581 - [i68]Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Michelle Yeo:
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. CoRR abs/2104.04293 (2021) - [i67]Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, Michelle Yeo:
HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks. CoRR abs/2110.08848 (2021) - [i66]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
On the Cost of Adaptivity in Graph-Based Games. IACR Cryptol. ePrint Arch. 2021: 59 (2021) - [i65]Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
On Treewidth, Separators and Yao's Garbling. IACR Cryptol. ePrint Arch. 2021: 926 (2021) - [i64]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs:
Limits on the Adaptive Security of Yao's Garbling. IACR Cryptol. ePrint Arch. 2021: 945 (2021) - [i63]Joël Alwen, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
Grafting Key Trees: Efficient Key Management for Overlapping Groups. IACR Cryptol. ePrint Arch. 2021: 1158 (2021) - [i62]Suvradip Chakraborty, Stefan Dziembowski
Trojan-Resilience without Cryptography. IACR Cryptol. ePrint Arch. 2021: 1224 (2021) - [i61]Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem
HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks. IACR Cryptol. ePrint Arch. 2021: 1401 (2021) - [i60]Zeta Avarikioti, Mahsa Bastankhah, Mohammad Ali Maddah-Ali, Krzysztof Pietrzak, Jakub Svoboda, Michelle Yeo:
Route Discovery in Private Payment Channel Networks. IACR Cryptol. ePrint Arch. 2021: 1539 (2021) - 2020
- [c78]Krzysztof Pietrzak:
Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing. INDOCRYPT 2020: 3-15 - [e3]Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12550, Springer 2020, ISBN 978-3-030-64374-4 [contents] - [e2]Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12551, Springer 2020, ISBN 978-3-030-64377-5 [contents] - [e1]Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III. Lecture Notes in Computer Science 12552, Springer 2020, ISBN 978-3-030-64380-5 [contents] - [i59]Krzysztof Pietrzak:
Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 418 (2020) - [i58]Benedikt Auerbach, Suvradip Chakraborty, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter, Michelle Yeo:
Inverse-Sybil Attacks in Automated Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 670 (2020)
2010 – 2019
- 2019
- [c77]Hamza Abusalah
Reversible Proofs of Sequential Work. EUROCRYPT (2) 2019: 277-291 - [c76]Krzysztof Pietrzak:
Proofs of Catalytic Space. ITCS 2019: 59:1-59:25 - [c75]Krzysztof Pietrzak:
Simple Verifiable Delay Functions. ITCS 2019: 60:1-60:15 - [c74]Georg Fuchsbauer, Chethan Kamath
Adaptively Secure Proxy Re-encryption. Public Key Cryptography (2) 2019: 317-346 - [c73]Arka Rai Choudhuri
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC 2019: 1103-1114 - [i57]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. TR19 (2019) - [i56]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2019: 252 (2019) - [i55]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 549 (2019) - [i54]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019: 667 (2019) - [i53]Joël Alwen, Margarita Capretto, Miguel Cueto, Chethan Kamath, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol. IACR Cryptol. ePrint Arch. 2019: 1489 (2019) - 2018
- [j7]Stefan Dziembowski
Non-Malleable Codes. J. ACM 65(4): 20:1-20:32 (2018) - [c72]Joël Alwen, Peter Gazi, Chethan Kamath
On the Memory-Hardness of Data-Independent Password-Hashing Functions. AsiaCCS 2018: 51-65 - [c71]Joël Alwen, Jeremiah Blocki
Sustained Space Complexity. EUROCRYPT (2) 2018: 99-130 - [c70]Bram Cohen, Krzysztof Pietrzak:
Simple Proofs of Sequential Work. EUROCRYPT (2) 2018: 451-467 - [c69]Sunoo Park, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joël Alwen, Krzysztof Pietrzak:
SpaceMint: A Cryptocurrency Based on Proofs of Space. Financial Cryptography 2018: 480-499 - [i52]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Sustained Space Complexity. IACR Cryptol. ePrint Arch. 2018: 147 (2018) - [i51]Bram Cohen, Krzysztof Pietrzak:
Simple Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2018: 183 (2018) - [i50]Krzysztof Pietrzak:
Proofs of Catalytic Space. IACR Cryptol. ePrint Arch. 2018: 194 (2018) - [i49]Georg Fuchsbauer, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Adaptively Secure Proxy Re-encryption. IACR Cryptol. ePrint Arch. 2018: 426 (2018) - [i48]Krzysztof Pietrzak:
Simple Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2018: 627 (2018) - 2017
- [j6]Eike Kiltz
Efficient Authentication from Hard Learning Problems. J. Cryptol. 30(4): 1238-1275 (2017) - [c68]Hamza Abusalah
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. ASIACRYPT (2) 2017: 357-379 - [c67]Zahra Jafargholi, Chethan Kamath
Be Adaptive, Avoid Overcommitting. CRYPTO (1) 2017: 133-163 - [c66]Joël Alwen, Jeremiah Blocki
Depth-Robust Graphs and Their Cumulative Memory Complexity. EUROCRYPT (3) 2017: 3-32 - [c65]Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro:
Scrypt Is Maximally Memory-Hard. EUROCRYPT (3) 2017: 33-62 - [c64]Krzysztof Pietrzak, Maciej Skorski
Non-Uniform Attacks Against Pseudoentropy. ICALP 2017: 39:1-39:13 - [c63]Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak:
Position-Based Cryptography and Multiparty Communication Complexity. TCC (1) 2017: 56-81 - [i47]Krzysztof Pietrzak, Maciej Skorski:
Non-Uniform Attacks Against Pseudoentropy. CoRR abs/1704.08678 (2017) - [i46]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Sustained Space Complexity. CoRR abs/1705.05313 (2017) - [i45]Peter Gazi, Krzysztof Pietrzak, Michal Rybár:
The Exact Security of PMAC. IACR Cryptol. ePrint Arch. 2017: 69 (2017) - [i44]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. IACR Cryptol. ePrint Arch. 2017: 515 (2017) - [i43]Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, Leonid Reyzin:
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. IACR Cryptol. ePrint Arch. 2017: 893 (2017) - 2016
- [j5]Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia, Daniel Wichs:
A counterexample to the chain rule for conditional HILL entropy. Comput. Complex. 25(3): 567-605 (2016) - [j4]Peter Gazi, Krzysztof Pietrzak, Michal Rybár:
The Exact Security of PMAC. IACR Trans. Symmetric Cryptol. 2016(2): 145-161 (2016) - [c62]Hamza Abusalah
Offline Witness Encryption. ACNS 2016: 285-303 - [c61]Hamza Abusalah
Constrained PRFs for Unbounded Inputs. CT-RSA 2016: 413-428 - [c60]Joël Alwen, Binyi Chen, Chethan Kamath
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. EUROCRYPT (2) 2016: 358-387 - [c59]Krzysztof Pietrzak, Maciej Skórski:
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. TCC (B1) 2016: 183-203 - [c58]Georg Fuchsbauer, Felix Heuer, Eike Kiltz
Standard Security Does Imply Security Against Selective Opening for Markov Distributions. TCC (A1) 2016: 282-305 - [i42]Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro:
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. IACR Cryptol. ePrint Arch. 2016: 100 (2016) - [i41]Krzysztof Pietrzak, Maciej Skorski
Pseudoentropy: Lower-bounds for Chain rules and Transformations. IACR Cryptol. ePrint Arch. 2016: 159 (2016) - [i40]Georg Fuchsbauer, Zahra Jafargholi, Krzysztof Pietrzak:
A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. IACR Cryptol. ePrint Arch. 2016: 389 (2016) - [i39]Joshua Brody, Stefan Dziembowski
Position-Based Cryptography and Multiparty Communication Complexity. IACR Cryptol. ePrint Arch. 2016: 536 (2016) - [i38]Marc Fischlin, Anja Lehmann, Krzysztof Pietrzak:
Robust Multi-Property Combiners for Hash Functions. IACR Cryptol. ePrint Arch. 2016: 723 (2016) - [i37]Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek, Michal Rybár:
On the Memory-Hardness of Data-Independent Password-Hashing Functions. IACR Cryptol. ePrint Arch. 2016: 783 (2016) - [i36]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Depth-Robust Graphs and Their Cumulative Memory Complexity. IACR Cryptol. ePrint Arch. 2016: 875 (2016) - [i35]Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro:
Scrypt is Maximally Memory-Hard. IACR Cryptol. ePrint Arch. 2016: 989 (2016) - 2015
- [c57]Peter Gazi, Krzysztof Pietrzak, Stefano Tessaro:
Generic Security of NMAC and HMAC with Input Whitening. ASIACRYPT (2) 2015: 85-109 - [c56]Tatsuaki Okamoto, Krzysztof Pietrzak, Brent Waters, Daniel Wichs:
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. ASIACRYPT (1) 2015: 121-145 - [c55]Peter Gazi, Krzysztof Pietrzak, Stefano Tessaro:
The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. CRYPTO (1) 2015: 368-387 - [c54]Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak:
Proofs of Space. CRYPTO (2) 2015: 585-605 - [c53]Georg Fuchsbauer, Zahra Jafargholi, Krzysztof Pietrzak:
A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. CRYPTO (1) 2015: 601-620 - [c52]Fabrice Benhamouda
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. ESORICS (1) 2015: 305-325 - [c51]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. ICALP (1) 2015: 1046-1057 - [c50]Krzysztof Pietrzak, Maciej Skorski
The Chain Rule for HILL Pseudoentropy, Revisited. LATINCRYPT 2015: 81-98 - [c49]Abhishek Banerjee, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens:
Key-Homomorphic Constrained Pseudorandom Functions. TCC (2) 2015: 31-60 - [i34]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. CoRR abs/1504.07621 (2015) - [i33]Peter Gazi, Krzysztof Pietrzak, Stefano Tessaro:
Tight Bounds for Keyed Sponges and Truncated CBC. IACR Cryptol. ePrint Arch. 2015: 53 (2015) - [i32]Abhishek Banerjee, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens:
Key-Homomorphic Constrained Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2015: 180 (2015) - [i31]Maciej Skorski
Condensed Unpredictability. IACR Cryptol. ePrint Arch. 2015: 384 (2015) - [i30]Eike Kiltz, Daniel Masny, Krzysztof Pietrzak:
Simple Chosen-Ciphertext Security from Low-Noise LPN. IACR Cryptol. ePrint Arch. 2015: 401 (2015) - [i29]Sunoo Park, Krzysztof Pietrzak, Albert Kwon, Joël Alwen, Georg Fuchsbauer, Peter Gazi:
Spacemint: A Cryptocurrency Based on Proofs of Space. IACR Cryptol. ePrint Arch. 2015: 528 (2015) - [i28]Krzysztof Pietrzak, Maciej Skorski
The Chain Rule for HILL Pseudoentropy, Revisited. IACR Cryptol. ePrint Arch. 2015: 599 (2015) - [i27]Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak:
Offline Witness Encryption. IACR Cryptol. ePrint Arch. 2015: 838 (2015) - [i26]Felix Heuer, Eike Kiltz, Krzysztof Pietrzak:
Standard Security Does Imply Security Against Selective Opening for Markov Distributions. IACR Cryptol. ePrint Arch. 2015: 853 (2015) - [i25]Tatsuaki Okamoto, Krzysztof Pietrzak, Brent Waters, Daniel Wichs:
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. IACR Cryptol. ePrint Arch. 2015: 869 (2015) - [i24]Peter Gazi, Krzysztof Pietrzak, Stefano Tessaro:
Generic Security of NMAC and HMAC with Input Whitening. IACR Cryptol. ePrint Arch. 2015: 881 (2015) - 2014
- [j3]Marc Fischlin, Anja Lehmann, Krzysztof Pietrzak:
Robust Multi-Property Combiners for Hash Functions. J. Cryptol. 27(3): 397-428 (2014) - [c48]Georg Fuchsbauer, Momchil Konstantinov, Krzysztof Pietrzak, Vanishree Rao:
Adaptive Security of Constrained PRFs. ASIACRYPT (2) 2014: 82-101 - [c47]Peter Gazi, Krzysztof Pietrzak, Michal Rybár:
The Exact PRF-Security of NMAC and HMAC. CRYPTO (1) 2014: 113-130 - [c46]Yevgeniy Dodis, Krzysztof Pietrzak, Daniel Wichs:
Key Derivation without Entropy Waste. EUROCRYPT 2014: 93-110 - [c45]Eike Kiltz
Simple Chosen-Ciphertext Security from Low-Noise LPN. Public Key Cryptography 2014: 1-18 - [c44]Dimitar Jetchev, Krzysztof Pietrzak:
How to Fake Auxiliary Input. TCC 2014: 566-590 - [i23]Georg Fuchsbauer, Momchil Konstantinov, Krzysztof Pietrzak, Vanishree Rao:
Adaptive Security of Constrained PRFs. IACR Cryptol. ePrint Arch. 2014: 416 (2014) - [i22]Peter Gazi, Krzysztof Pietrzak, Michal Rybár:
The Exact PRF-Security of NMAC and HMAC. IACR Cryptol. ePrint Arch. 2014: 578 (2014) - [i21]Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia, Daniel Wichs:
A Counterexample to the Chain Rule for Conditional HILL Entropy. IACR Cryptol. ePrint Arch. 2014: 678 (2014) - [i20]Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak:
Constrained PRFs for Unbounded Inputs. IACR Cryptol. ePrint Arch. 2014: 840 (2014) - [i19]Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak:
Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. IACR Cryptol. ePrint Arch. 2014: 889 (2014) - 2013
- [c43]Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, Daniel Wichs:
Learning with Rounding, Revisited - New Reduction, Properties and Applications. CRYPTO (1) 2013: 57-74 - [c42]Eike Kiltz
Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. CRYPTO (1) 2013: 571-588 - [c41]Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia:
A Counterexample to the Chain Rule for Conditional HILL Entropy - And What Deniable Encryption Has to Do with It. TCC 2013: 23-39 - [i18]Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, Daniel Wichs:
Learning with Rounding, Revisited: New Reduction, Properties and Applications. IACR Cryptol. ePrint Arch. 2013: 98 (2013) - [i17]Krzysztof Pietrzak:
A Closer Look at HMAC. IACR Cryptol. ePrint Arch. 2013: 212 (2013) - [i16]Yevgeniy Dodis, Krzysztof Pietrzak, Daniel Wichs:
Key Derivation Without Entropy Waste. IACR Cryptol. ePrint Arch. 2013: 708 (2013) - [i15]Stefan Dziembowski
Proofs of Space. IACR Cryptol. ePrint Arch. 2013: 796 (2013) - [i14]Dimitar Jetchev, Krzysztof Pietrzak:
How to Fake Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 869 (2013) - 2012
- [j2]Krzysztof Pietrzak, Douglas Wikström:
Parallel Repetition of Computationally Sound Protocols Revisited. J. Cryptol. 25(1): 116-135 (2012) - [c40]Abhishek Jain, Stephan Krenn, Krzysztof Pietrzak, Aris Tentes:
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise. ASIACRYPT 2012: 663-680 - [c39]Sebastian Faust, Krzysztof Pietrzak, Joachim Schipper:
Practical Leakage-Resilient Symmetric Cryptography. CHES 2012: 213-232 - [c38]Yevgeniy Dodis, Eike Kiltz
Message Authentication, Revisited. EUROCRYPT 2012: 355-374 - [c37]Stefan Heyse, Eike Kiltz
Lapin: An Efficient Authentication Protocol Based on Ring-LPN. FSE 2012: 346-365 - [c36]Krzysztof Pietrzak:
Cryptography from Learning Parity with Noise. SOFSEM 2012: 99-114 - [c35]Abhishek Jain, Krzysztof Pietrzak, Aris Tentes:
Hardness Preserving Constructions of Pseudorandom Functions. TCC 2012: 369-382 - [c34]Krzysztof Pietrzak, Alon Rosen, Gil Segev:
Lossy Functions Do Not Amplify Well. TCC 2012: 458-475 - [c33]Krzysztof Pietrzak:
Subspace LWE. TCC 2012: 548-563 - [i13]Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs:
Message Authentication, Revisited. IACR Cryptol. ePrint Arch. 2012: 59 (2012) - [i12]Abhishek Jain
Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems. IACR Cryptol. ePrint Arch. 2012: 513 (2012) - [i11]Eike Kiltz, Krzysztof Pietrzak, Mario Szegedy:
Digital Signatures with Minimal Overhead. IACR Cryptol. ePrint Arch. 2012: 658 (2012) - 2011
- [c32]Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert
Leftover Hash Lemma, Revisited. CRYPTO 2011: 1-20 - [c31]Eike Kiltz
Efficient Authentication from Hard Learning Problems. EUROCRYPT 2011: 7-26 - [c30]Sebastian Faust, Krzysztof Pietrzak, Daniele Venturi
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience. ICALP (1) 2011: 391-402 - [c29]Abhishek Jain, Krzysztof Pietrzak:
Parallel Repetition for Leakage Resilience Amplification Revisited. TCC 2011: 58-69 - [i10]Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, Yu Yu:
Leftover Hash Lemma, Revisited. IACR Cryptol. ePrint Arch. 2011: 88 (2011) - [i9]Sebastian Faust, Krzysztof Pietrzak, Daniele Venturi:
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience. IACR Cryptol. ePrint Arch. 2011: 314 (2011) - 2010
- [c28]Eike Kiltz
Leakage Resilient ElGamal Encryption. ASIACRYPT 2010: 595-612 - [c27]Yevgeniy Dodis, Krzysztof Pietrzak:
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks. CRYPTO 2010: 21-40 - [c26]Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. ICS 2010: 434-452 - [c25]Johan Håstad
An Efficient Parallel Repetition Theorem. TCC 2010: 1-18 - [c24]Sebastian Faust, Eike Kiltz
Leakage-Resilient Signatures. TCC 2010: 343-360
2000 – 2009
- 2009
- [c23]Eike Kiltz
On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model. EUROCRYPT 2009: 389-406 - [c22]Krzysztof Pietrzak:
A Leakage-Resilient Mode of Operation. EUROCRYPT 2009: 462-482 - [c21]Eike Kiltz
A New Randomness Extraction Paradigm for Hybrid Encryption. EUROCRYPT 2009: 590-609 - [i8]Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum:
Leakage-Resilient Signatures. IACR Cryptol. ePrint Arch. 2009: 282 (2009) - [i7]Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2009: 608 (2009) - 2008
- [c20]Krzysztof Pietrzak:
Compression from Collisions, or Why CRHF Combiners Have a Long Output. CRYPTO 2008: 413-432 - [c19]Yevgeniy Dodis, Krzysztof Pietrzak, Prashant Puniya:
A New Mode of Operation for Block Ciphers and Length-Preserving MACs. EUROCRYPT 2008: 198-219 - [c18]Stefan Dziembowski
Leakage-Resilient Cryptography. FOCS 2008: 293-302 - [c17]Krzysztof Pietrzak, Johan Sjödin:
Weak Pseudorandom Functions in Minicrypt. ICALP (2) 2008: 423-436 - [c16]Marc Fischlin, Anja Lehmann, Krzysztof Pietrzak:
Robust Multi-property Combiners for Hash Functions Revisited. ICALP (2) 2008: 655-666 - [i6]Stefan Dziembowski, Krzysztof Pietrzak:
Leakage-Resilient Cryptography in the Standard Model. IACR Cryptol. ePrint Arch. 2008: 240 (2008) - [i5]Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung:
A New Randomness Extraction Paradigm for Hybrid Encryption. IACR Cryptol. ePrint Arch. 2008: 304 (2008) - 2007
- [c15]Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner:
Indistinguishability Amplification. CRYPTO 2007: 130-149 - [c14]Krzysztof Pietrzak:
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist. EUROCRYPT 2007: 23-33 - [c13]Krzysztof Pietrzak, Johan Sjödin:
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly. EUROCRYPT 2007: 517-533 - [c12]Stefan Dziembowski
Intrusion-Resilient Secret Sharing. FOCS 2007: 227-237 - [c11]Yevgeniy Dodis, Krzysztof Pietrzak:
Improving the Security of MACs Via Randomized Message Preprocessing. FSE 2007: 414-433 - [c10]Krzysztof Pietrzak, Douglas Wikström:
Parallel Repetition of Computationally Sound Protocols Revisited. TCC 2007: 86-102 - [i4]Stefan Dziembowski, Krzysztof Pietrzak:
Intrusion-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2007: 359 (2007) - 2006
- [b1]Krzysztof Pietrzak:
Indistinguishability and composition of random systems. ETH Zurich, 2006, ISBN 3-86628-063-7, pp. 1-82 - [c9]Krzysztof Pietrzak:
Composition Implies Adaptive Security in Minicrypt. EUROCRYPT 2006: 328-338 - [c8]Ueli M. Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, Johan Sjödin:
Luby-Rackoff Ciphers from Weak Round Functions? EUROCRYPT 2006: 391-408 - [c7]Krzysztof Pietrzak:
A Tight Bound for EMAC. ICALP (2) 2006: 168-179 - [c6]Yevgeniy Dodis, Krzysztof Pietrzak, Bartosz Przydatek:
Separating Sources for Encryption and Secret Sharing. TCC 2006: 601-616 - [i3]Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, Johan Sjödin:
Luby-Rackoff Ciphers from Weak Round Functions? IACR Cryptol. ePrint Arch. 2006: 213 (2006) - [i2]Krzysztof Pietrzak:
Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions don't Exist. IACR Cryptol. ePrint Arch. 2006: 348 (2006) - [i1]Ueli Maurer, Krzysztof Pietrzak, Renato Renner:
Indistinguishability Amplification. IACR Cryptol. ePrint Arch. 2006: 456 (2006) - 2005
- [c5]Krzysztof Pietrzak:
Composition Does Not Imply Adaptive Security. CRYPTO 2005: 55-65 - [c4]Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrzak:
On the Generic Insecurity of the Full Domain Hash. CRYPTO 2005: 449-466 - [c3]Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway:
Improved Security Analyses for CBC MACs. CRYPTO 2005: 527-545 - 2004
- [c2]Ueli M. Maurer, Krzysztof Pietrzak:
Composition of Random Systems: When Two Weak Make One Strong. TCC 2004: 410-427 - 2003
- [j1]Krzysztof Pietrzak:
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4): 757-771 (2003) - [c1]Ueli M. Maurer, Krzysztof Pietrzak:
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. EUROCRYPT 2003: 544-561
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: