Krzysztof Pietrzak

According to our database1, Krzysztof Pietrzak authored at least 90 papers between 2003 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
PPAD-Hardness via Iterated Squaring Modulo a Composite.
IACR Cryptology ePrint Archive, 2019

Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.
IACR Cryptology ePrint Archive, 2019

Reversible Proofs of Sequential Work.
IACR Cryptology ePrint Archive, 2019

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
Electronic Colloquium on Computational Complexity (ECCC), 2019

2018
Non-Malleable Codes.
J. ACM, 2018

Simple Verifiable Delay Functions.
IACR Cryptology ePrint Archive, 2018

Proofs of Catalytic Space.
IACR Cryptology ePrint Archive, 2018

Adaptively Secure Proxy Re-encryption.
IACR Cryptology ePrint Archive, 2018

Simple Proofs of Sequential Work.
IACR Cryptology ePrint Archive, 2018

Sustained Space Complexity.
IACR Cryptology ePrint Archive, 2018

2017
Efficient Authentication from Hard Learning Problems.
J. Cryptology, 2017

Be Adaptive, Avoid Overcommitting.
IACR Cryptology ePrint Archive, 2017

The Exact Security of PMAC.
IACR Cryptology ePrint Archive, 2017

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space.
IACR Cryptology ePrint Archive, 2017

Non-Uniform Attacks Against Pseudoentropy.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Pseudoentropy: Lower-bounds for Chain rules and Transformations.
IACR Cryptology ePrint Archive, 2016

A Quasipolynomial Reduction for Generalized Selective Decryption on Trees.
IACR Cryptology ePrint Archive, 2016

Position-Based Cryptography and Multiparty Communication Complexity.
IACR Cryptology ePrint Archive, 2016

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
IACR Cryptology ePrint Archive, 2016

Scrypt is Maximally Memory-Hard.
IACR Cryptology ePrint Archive, 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptology ePrint Archive, 2016

Depth-Robust Graphs and Their Cumulative Memory Complexity.
IACR Cryptology ePrint Archive, 2016

A counterexample to the chain rule for conditional HILL entropy.
Computational Complexity, 2016

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
Condensed Unpredictability.
IACR Cryptology ePrint Archive, 2015

The Chain Rule for HILL Pseudoentropy, Revisited.
IACR Cryptology ePrint Archive, 2015

Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptology ePrint Archive, 2015

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators.
IACR Cryptology ePrint Archive, 2015

Simple Chosen-Ciphertext Security from Low-Noise LPN.
IACR Cryptology ePrint Archive, 2015

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.
IACR Cryptology ePrint Archive, 2015

Generic Security of NMAC and HMAC with Input Whitening.
IACR Cryptology ePrint Archive, 2015

Tight Bounds for Keyed Sponges and Truncated CBC.
IACR Cryptology ePrint Archive, 2015

Offline Witness Encryption.
IACR Cryptology ePrint Archive, 2015

Key-Homomorphic Constrained Pseudorandom Functions.
IACR Cryptology ePrint Archive, 2015

The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Robust Multi-Property Combiners for Hash Functions.
J. Cryptology, 2014

The Exact PRF-Security of NMAC and HMAC.
IACR Cryptology ePrint Archive, 2014

Adaptive Security of Constrained PRFs.
IACR Cryptology ePrint Archive, 2014

Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings.
IACR Cryptology ePrint Archive, 2014

Constrained PRFs for Unbounded Inputs.
IACR Cryptology ePrint Archive, 2014

2013
A Closer Look at HMAC.
IACR Cryptology ePrint Archive, 2013

How to Fake Auxiliary Input.
IACR Cryptology ePrint Archive, 2013

Proofs of Space.
IACR Cryptology ePrint Archive, 2013

Key Derivation Without Entropy Waste.
IACR Cryptology ePrint Archive, 2013

Learning with Rounding, Revisited: New Reduction, Properties and Applications.
IACR Cryptology ePrint Archive, 2013

A Counterexample to the Chain Rule for Conditional HILL Entropy - And What Deniable Encryption Has to Do with It.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Parallel Repetition of Computationally Sound Protocols Revisited.
J. Cryptology, 2012

Digital Signatures with Minimal Overhead.
IACR Cryptology ePrint Archive, 2012

Message Authentication, Revisited.
IACR Cryptology ePrint Archive, 2012

Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems.
IACR Cryptology ePrint Archive, 2012

Lossy Functions Do Not Amplify Well.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Subspace LWE.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Hardness Preserving Constructions of Pseudorandom Functions.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Cryptography from Learning Parity with Noise.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Lapin: An Efficient Authentication Protocol Based on Ring-LPN.
Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Practical Leakage-Resilient Symmetric Cryptography.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience.
IACR Cryptology ePrint Archive, 2011

Leftover Hash Lemma, Revisited.
IACR Cryptology ePrint Archive, 2011

Parallel Repetition for Leakage Resilience Amplification Revisited.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
An Efficient Parallel Repetition Theorem.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks.
Proceedings of the Advances in Cryptology, 2010

Leakage Resilient ElGamal Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Leakage-Resilient Signatures.
IACR Cryptology ePrint Archive, 2009

A Leakage-Resilient Mode of Operation.
Proceedings of the Advances in Cryptology, 2009

On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model.
Proceedings of the Advances in Cryptology, 2009

2008
A New Randomness Extraction Paradigm for Hybrid Encryption.
IACR Cryptology ePrint Archive, 2008

Leakage-Resilient Cryptography in the Standard Model.
IACR Cryptology ePrint Archive, 2008

Weak Pseudorandom Functions in Minicrypt.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Robust Multi-property Combiners for Hash Functions Revisited.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Leakage-Resilient Cryptography.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

A New Mode of Operation for Block Ciphers and Length-Preserving MACs.
Proceedings of the Advances in Cryptology, 2008

Compression from Collisions, or Why CRHF Combiners Have a Long Output.
Proceedings of the Advances in Cryptology, 2008

2007
Intrusion-Resilient Secret Sharing.
IACR Cryptology ePrint Archive, 2007

Improving the Security of MACs Via Randomized Message Preprocessing.
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

Range Extension for Weak PRFs; The Good, the Bad, and the Ugly.
Proceedings of the Advances in Cryptology, 2007

2006
Indistinguishability and composition of random systems.
PhD thesis, 2006

Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions don't Exist.
IACR Cryptology ePrint Archive, 2006

Indistinguishability Amplification.
IACR Cryptology ePrint Archive, 2006

Luby-Rackoff Ciphers from Weak Round Functions?
IACR Cryptology ePrint Archive, 2006

Separating Sources for Encryption and Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

A Tight Bound for EMAC.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Composition Implies Adaptive Security in Minicrypt.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005
Composition Does Not Imply Adaptive Security.
Proceedings of the Advances in Cryptology, 2005

On the Generic Insecurity of the Full Domain Hash.
Proceedings of the Advances in Cryptology, 2005

Improved Security Analyses for CBC MACs.
Proceedings of the Advances in Cryptology, 2005

2004
Composition of Random Systems: When Two Weak Make One Strong.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

2003
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems.
J. Comput. Syst. Sci., 2003

The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations.
Proceedings of the Advances in Cryptology, 2003


  Loading...