Krzysztof Pietrzak

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Continuous group-key agreement: concurrent updates without pruning	2026-02-06	Paper
Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation	2025-07-29	Paper
The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging	2025-07-23	Paper
Fully automated selfish mining analysis in efficient proof systems blockchains	2025-06-13	Paper
Trapdoor memory-hard functions	2024-11-13	Paper
Efficiently testable circuits	2024-09-25	Paper
Efficiently testable circuits without conductivity	2024-08-02	Paper
On the cost of post-compromise security in concurrent continuous group-key agreement	2024-08-02	Paper
Certifying giant nonprimes Lecture Notes in Computer Science	2023-11-24	Paper
Practical statistically-sound proofs of exponentiation in any group Advances in Cryptology – CRYPTO 2022	2023-06-28	Paper
\textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks Financial Cryptography and Data Security	2023-05-26	Paper
On treewidth, separators and Yao's garbling	2023-04-13	Paper
Trojan-resilience without cryptography	2023-04-13	Paper
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings Computer Security -- ESORICS 2015	2022-08-19	Paper
Simple verifiable delay functions	2022-07-18	Paper
Proofs of Catalytic Space	2022-07-18	Paper
Delayed authentication: preventing replay and relay attacks in private contact tracing	2022-07-06	Paper
Limits on the adaptive security of Yao's garbling	2022-04-22	Paper
Non-uniform attacks against pseudoentropy (available as arXiv preprint)	2020-05-27	Paper
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	2020-01-30	Paper
Adaptively secure proxy re-encryption	2020-01-28	Paper
Non-malleable codes Journal of the ACM	2018-12-06	Paper
Sustained space complexity (available as arXiv preprint)	2018-07-09	Paper
Simple proofs of sequential work	2018-07-09	Paper
Beyond Hellman's time-memory trade-offs with applications to proofs of space	2018-03-08	Paper
Efficient authentication from hard learning problems Journal of Cryptology	2018-02-15	Paper
Position-based cryptography and multiparty communication complexity	2018-01-19	Paper
Be adaptive, avoid overcommitting	2017-11-03	Paper
Depth-robust graphs and their cumulative memory complexity Lecture Notes in Computer Science	2017-06-23	Paper
Scrypt is maximally memory-hard Lecture Notes in Computer Science	2017-06-23	Paper
Pseudoentropy: lower-bounds for chain rules and transformations Theory of Cryptography	2016-12-21	Paper
A counterexample to the chain rule for conditional HILL entropy Computational Complexity	2016-10-28	Paper
Offline witness encryption Applied Cryptography and Network Security	2016-10-04	Paper
On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model Advances in Cryptology – EUROCRYPT 2016	2016-07-15	Paper
New realizations of somewhere statistically binding hashing and positional accumulators Advances in Cryptology -- ASIACRYPT 2015	2016-06-10	Paper
Constrained PRFs for unbounded inputs Topics in Cryptology - CT-RSA 2016	2016-04-08	Paper
Standard Security Does Imply Security Against Selective Opening for Markov Distributions Theory of Cryptography	2016-03-23	Paper
Generic security of NMAC and HMAC with input whitening Advances in Cryptology – ASIACRYPT 2015	2016-03-23	Paper
The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC Lecture Notes in Computer Science	2015-12-10	Paper
Proofs of space Lecture Notes in Computer Science	2015-12-10	Paper
A quasipolynomial reduction for generalized selective decryption on trees Lecture Notes in Computer Science	2015-12-10	Paper
Condensed Unpredictability Automata, Languages, and Programming	2015-10-27	Paper
Condensed Unpredictability Automata, Languages, and Programming	2015-10-27	Paper
The chain rule for HILL pseudoentropy, revisited Progress in Cryptology -- LATINCRYPT 2015	2015-09-17	Paper
Key-homomorphic constrained pseudorandom functions Theory of Cryptography	2015-07-06	Paper
Adaptive Security of Constrained PRFs Lecture Notes in Computer Science	2015-01-06	Paper
Robust multi-property combiners for hash functions Journal of Cryptology	2014-09-25	Paper
The exact PRF-security of NMAC and HMAC Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
Key derivation without entropy waste Advances in Cryptology – EUROCRYPT 2014	2014-05-27	Paper
Simple chosen-ciphertext security from low-noise LPN Public-Key Cryptography – PKC 2014	2014-03-25	Paper
How to fake auxiliary input Theory of Cryptography	2014-02-18	Paper
Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions Advances in Cryptology – CRYPTO 2013	2013-09-02	Paper
Learning with rounding, revisited. New reduction, properties and applications Advances in Cryptology – CRYPTO 2013	2013-09-02	Paper
Commitments and efficient zero-knowledge proofs from learning parity with noise Advances in Cryptology – ASIACRYPT 2012	2013-03-19	Paper
A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it Theory of Cryptography	2013-03-18	Paper
Lapin: an efficient authentication protocol based on ring-LPN Fast Software Encryption	2013-01-08	Paper
Practical leakage-resilient symmetric cryptography Cryptographic Hardware and Embedded Systems – CHES 2012	2012-11-13	Paper
Message authentication, revisited Advances in Cryptology – EUROCRYPT 2012	2012-06-29	Paper
Cryptography from learning parity with noise SOFSEM 2012: Theory and Practice of Computer Science	2012-06-15	Paper
Hardness preserving constructions of pseudorandom functions Theory of Cryptography	2012-06-15	Paper
Subspace LWE Theory of Cryptography	2012-06-15	Paper
Lossy functions do not amplify well Theory of Cryptography	2012-06-15	Paper
Parallel repetition of computationally sound protocols revisited Journal of Cryptology	2012-05-23	Paper
Leftover Hash Lemma, Revisited Advances in Cryptology – CRYPTO 2011	2011-08-12	Paper
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience Automata, Languages and Programming	2011-07-06	Paper
Efficient Authentication from Hard Learning Problems Advances in Cryptology – EUROCRYPT 2011	2011-05-27	Paper
Parallel Repetition for Leakage Resilience Amplification Revisited Theory of Cryptography	2011-05-19	Paper
Leakage resilient ElGamal encryption Advances in Cryptology - ASIACRYPT 2010	2010-12-07	Paper
Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks Advances in Cryptology – CRYPTO 2010	2010-08-24	Paper
An efficient parallel repetition theorem Theory of Cryptography	2010-02-24	Paper
Leakage-resilient signatures Theory of Cryptography	2010-02-24	Paper
Theory of Cryptography Lecture Notes in Computer Science	2009-05-14	Paper
A Leakage-Resilient Mode of Operation Advances in Cryptology - EUROCRYPT 2009	2009-05-12	Paper
On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model Advances in Cryptology - EUROCRYPT 2009	2009-05-12	Paper
A New Randomness Extraction Paradigm for Hybrid Encryption Advances in Cryptology - EUROCRYPT 2009	2009-05-12	Paper
Indistinguishability Amplification Advances in Cryptology - CRYPTO 2007	2009-03-10	Paper
Compression from Collisions, or Why CRHF Combiners Have a Long Output Lecture Notes in Computer Science	2009-02-10	Paper
Improving the Security of MACs Via Randomized Message Preprocessing Fast Software Encryption	2008-09-16	Paper
Robust Multi-property Combiners for Hash Functions Revisited Automata, Languages and Programming	2008-08-19	Paper
Weak Pseudorandom Functions in Minicrypt Automata, Languages and Programming	2008-08-19	Paper
A New Mode of Operation for Block Ciphers and Length-Preserving MACs Advances in Cryptology – EUROCRYPT 2008	2008-04-15	Paper
On the Generic Insecurity of the Full Domain Hash Advances in Cryptology – CRYPTO 2005	2008-03-17	Paper
Improved Security Analyses for CBC MACs Advances in Cryptology – CRYPTO 2005	2008-03-17	Paper
Composition Does Not Imply Adaptive Security Advances in Cryptology – CRYPTO 2005	2008-03-17	Paper
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist Advances in Cryptology - EUROCRYPT 2007	2007-11-29	Paper
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly Advances in Cryptology - EUROCRYPT 2007	2007-11-29	Paper
Luby-Rackoff Ciphers from Weak Round Functions? Advances in Cryptology - EUROCRYPT 2006	2007-09-24	Paper
Composition Implies Adaptive Security in Minicrypt Advances in Cryptology - EUROCRYPT 2006	2007-09-24	Paper
A Tight Bound for EMAC Automata, Languages and Programming	2007-09-11	Paper
Parallel Repetition of Computationally Sound Protocols Revisited Theory of Cryptography	2007-08-30	Paper
Theory of Cryptography Lecture Notes in Computer Science	2007-02-12	Paper
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems Journal of Computer and System Sciences	2004-08-19	Paper
scientific article; zbMATH DE number 2009979 (Why is no real title available?)	2003-11-26	Paper

Research outcomes over time

This page was built for person: Krzysztof Pietrzak