83 Publications

Mark all

[83]
2019 | Conference Paper | IST-REx-ID: 6528   OA
K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124, p. 60.
View | Files available | DOI
 
[82]
2019 | Conference Paper | IST-REx-ID: 6430
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “Adaptively secure proxy re-encryption,” presented at the PKC: Public-Key Cryptograhy, Beijing, China, 2019, vol. 11443, pp. 317–346.
View | DOI
 
[81]
2019 | Conference Paper | IST-REx-ID: 6677
A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.
View | DOI
 
[80]
2018 | Conference Paper | IST-REx-ID: 193   OA
J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
[79]
2018 | Conference Paper | IST-REx-ID: 302   OA
B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.
View | DOI | Download (ext.)
 
[78]
2018 | Conference Paper | IST-REx-ID: 6941   OA
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.
View | DOI | Download (ext.)
 
[77]
2018 | Journal Article | IST-REx-ID: 107
S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal of the ACM, vol. 65, no. 4, 2018.
View | DOI
 
[76]
2018 | Conference Paper | IST-REx-ID: 298   OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.
View | DOI | Download (ext.)
 
[75]
2017 | Conference Paper | IST-REx-ID: 605   OA
J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.
View | DOI | Download (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 559
H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.
View | Files available | DOI | Download (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 637   OA
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.
View | DOI | Download (ext.)
 
[72]
2017 | Journal Article | IST-REx-ID: 1187
E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4, pp. 1238–1275, 2017.
View | Files available | DOI
 
[71]
2017 | Conference Paper | IST-REx-ID: 640   OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.
View | DOI | Download (ext.)
 
[70]
2017 | Conference Paper | IST-REx-ID: 635   OA
J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.
View | DOI | Download (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 697   OA
K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 2017, vol. 80.
View | Files available | DOI
 
[68]
2017 | Journal Article | IST-REx-ID: 6196
P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, pp. 145–161, 2017.
View | Files available | DOI
 
[67]
2016 | Conference Paper | IST-REx-ID: 1231   OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
View | DOI | Download (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1229
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.
View | Files available | DOI
 
[65]
2016 | Conference Paper | IST-REx-ID: 1236
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.
View | Files available | DOI
 
[64]
2016 | Conference Paper | IST-REx-ID: 1179   OA
K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.
View | DOI | Download (ext.)
 
[63]
2016 | Conference Paper | IST-REx-ID: 1233   OA
G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.
View | DOI | Download (ext.)
 
[62]
2016 | Journal Article | IST-REx-ID: 1479
S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3, pp. 567–605, 2016.
View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1653   OA
T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.
View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1654   OA
P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.
View | Files available | DOI
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648   OA
G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction for generalized selective decryption on trees,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.
View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1650   OA
M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability ,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 1046–1057.
View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1649   OA
F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.
View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1675
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.
View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669   OA
K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.
View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671   OA
P. Gazi, K. Z. Pietrzak, and S. Tessaro, “The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9215, pp. 368–387.
View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1646   OA
A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic constrained pseudorandom functions,” vol. 9015. Springer, pp. 31–60, 2015.
View | Files available | DOI
 
[52]
2014 | Conference Paper | IST-REx-ID: 2082
P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.
View | Files available | DOI
 
[51]
2014 | Conference Paper | IST-REx-ID: 1927   OA
G. Fuchsbauer, M. Konstantinov, K. Z. Pietrzak, and V. Rao, “Adaptive security of constrained PRFs,” presented at the Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, vol. 8874, pp. 173–192.
View | DOI | Download (ext.)
 
[50]
2014 | Conference Paper | IST-REx-ID: 2236   OA
D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590.
View | Files available | DOI | Download (ext.)
 
[49]
2014 | Conference Paper | IST-REx-ID: 2185   OA
Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.
View | Files available | DOI
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3, pp. 397–428, 2014.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2219   OA
E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security from low noise LPN,” presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18.
View | DOI | Download (ext.)
 
[46]
2013 | Conference Paper | IST-REx-ID: 2258   OA
E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.
View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2259   OA
J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.
View | Files available | DOI
 
[44]
2013 | Report | IST-REx-ID: 2274   OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
View | Files available
 
[43]
2013 | Conference Paper | IST-REx-ID: 2940   OA
S. Krenn, K. Z. Pietrzak, and A. Wadia, “A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it,” presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan, 2013, vol. 7785, pp. 23–39.
View | Files available | DOI
 
[42]
2012 | Conference Paper | IST-REx-ID: 2049   OA
S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in Conference proceedings FSE 2012, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.
View | DOI | Download (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2974   OA
A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680.
View | Files available | DOI
 
[40]
2012 | Conference Paper | IST-REx-ID: 3282   OA
Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.
View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” Journal of Cryptology, vol. 25, no. 1, pp. 116–135, 2012.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3280   OA
K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.
View | DOI | Download (ext.)
 
[37]
2012 | Conference Paper | IST-REx-ID: 2048   OA
S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in Conference proceedings CHES 2012, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.
View | DOI | Download (ext.)
 
[36]
2012 | Conference Paper | IST-REx-ID: 3250
K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.
View | DOI
 
[35]
2012 | Conference Paper | IST-REx-ID: 3279
A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.
View | DOI | Download (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3281
K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.
View | DOI | Download (ext.)
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
B. Barak et al., “Leftover hash lemma revisited,” presented at the CRYPTO: International Cryptology Conference, 2011, vol. 6841, pp. 1–20.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3238
E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.
View | Files available | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3239
S. Faust, K. Z. Pietrzak, and D. Venturi, “Tamper proof circuits How to trade leakage for tamper resilience,” presented at the ICALP: Automata, Languages and Programming, 2011, vol. 6755, no. Part 1, pp. 391–402.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3236
A. Jain and K. Z. Pietrzak, “Parallel repetition for leakage resilience amplification revisited,” presented at the TCC: Theory of Cryptography Conference, 2011, vol. 6597, pp. 58–69.
View | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
E. Kiltz and K. Z. Pietrzak, “Leakage resilient ElGamal encryption,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, 2010, vol. 6477, pp. 595–612.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3233
J. Håstad, R. Pass, D. Wikström, and K. Z. Pietrzak, “An efficient parallel repetition theorem,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 1–18.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
S. Faust, E. Kiltz, K. Z. Pietrzak, and G. Rothblum, “Leakage resilient signatures,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 343–360.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3235
Y. Dodis and K. Z. Pietrzak, “Leakage resilient pseudorandom functions and side channel attacks on feistel networks,” presented at the CRYPTO: International Cryptology Conference, 2010, vol. 6223, pp. 21–40.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3232
K. Z. Pietrzak, “A leakage resilient mode of operation,” presented at the CRYPTO: International Cryptology Conference, 2009, vol. 5479, pp. 462–482.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3230
E. Kiltz, K. Z. Pietrzak, M. Stam, and M. Yung, “A new randomness extraction paradigm for hybrid encryption,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2009, vol. 5479, pp. 590–609.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3231
E. Kiltz and K. Z. Pietrzak, “On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2009, vol. 5479, pp. 389–406.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3225
M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi property combiners for hash functions revisited,” presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126, no. PART 2, pp. 655–666.
View | Files available | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3226
K. Z. Pietrzak and J. Sjödin, “Weak pseudorandom functions in minicrypt,” presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126, no. PART 2, pp. 423–436.
View | DOI
 
[20]
2008 | Journal Article | IST-REx-ID: 3227
P. Zubielik, J. Nadaczny, K. Z. Pietrzak, and M. Lawenda, “Elektrowiz – system of measurement data management,” Przeglad Elektrotechniczny, vol. 84, no. 10, pp. 239–242, 2008.
View | Download (ext.)
 
[19]
2008 | Conference Paper | IST-REx-ID: 3228
K. Z. Pietrzak, “Compression from collisions or why CRHF combiners have a long output,” presented at the CRYPTO: International Cryptology Conference, 2008, vol. 5157, pp. 413–432.
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
Y. Dodis, K. Z. Pietrzak, and P. Puniya, “A new mode of operation for block ciphers and length preserving MACs,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2008, vol. 4965, pp. 198–219.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3229
S. Dziembowski and K. Z. Pietrzak, “Leakage resilient cryptography,” presented at the FOCS: Foundations of Computer Science, 2008, pp. 293–302.
View | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
K. Z. Pietrzak, “Non-trivial black-box combiners for collision-resistant hash-functions don’t exist,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 23–33.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3220
S. Dziembowski and K. Z. Pietrzak, “Intrusion resilient secret sharing,” presented at the FOCS: Foundations of Computer Science, 2007, pp. 227–237.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3219
U. Maurer, K. Z. Pietrzak, and R. Renner, “Indistinguishability amplification,” presented at the CRYPTO: International Cryptology Conference, 2007, vol. 4622, pp. 130–149.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3221
K. Z. Pietrzak and J. Sjödin, “Range extension for weak PRFs the good the bad and the ugly,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 517–533.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3222
K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” presented at the TCC: Theory of Cryptography Conference, 2007, vol. 4392, pp. 86–102.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3223
Y. Dodis and K. Z. Pietrzak, “Improving the security of MACs via randomized message preprocessing,” presented at the FSE: Fast Software Encryption, 2007, vol. 4593, pp. 414–433.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
U. Maurer, Y. Oswald, K. Z. Pietrzak, and J. Sjödin, “Luby Rackoff ciphers from weak round functions ,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2006, vol. 4004, pp. 391–408.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Y. Dodis, K. Z. Pietrzak, and B. Przydatek, “Separating sources for encryption and secret sharing,” presented at the TCC: Theory of Cryptography Conference, 2006, vol. 3876, pp. 601–616.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3216
K. Z. Pietrzak, “A tight bound for EMAC,” presented at the ICALP: Automata, Languages and Programming, 2006, vol. 4052, pp. 168–179.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3217
K. Z. Pietrzak, “Composition implies adaptive security in minicrypt,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2006, vol. 4004, pp. 328–338.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3213
K. Z. Pietrzak, “Composition does not imply adaptive security,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 55–65.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3211
M. Bellare, K. Z. Pietrzak, and P. Rogaway, “Improved security analyses for CBC MACs,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 527–545.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3212
Y. Dodis, R. Oliveira, and K. Z. Pietrzak, “On the generic insecurity of the full domain hash,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 449–466.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak make one strong,” presented at the TCC: Theory of Cryptography Conference, 2004, vol. 2951, pp. 410–427.
View | DOI
 
[2]
2003 | Conference Paper | IST-REx-ID: 3210
U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561.
View | DOI
 
[1]
2003 | Journal Article | IST-REx-ID: 3209
K. Z. Pietrzak, “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, pp. 757–771, 2003.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

83 Publications

Mark all

[83]
2019 | Conference Paper | IST-REx-ID: 6528   OA
K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124, p. 60.
View | Files available | DOI
 
[82]
2019 | Conference Paper | IST-REx-ID: 6430
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “Adaptively secure proxy re-encryption,” presented at the PKC: Public-Key Cryptograhy, Beijing, China, 2019, vol. 11443, pp. 317–346.
View | DOI
 
[81]
2019 | Conference Paper | IST-REx-ID: 6677
A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.
View | DOI
 
[80]
2018 | Conference Paper | IST-REx-ID: 193   OA
J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
[79]
2018 | Conference Paper | IST-REx-ID: 302   OA
B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.
View | DOI | Download (ext.)
 
[78]
2018 | Conference Paper | IST-REx-ID: 6941   OA
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.
View | DOI | Download (ext.)
 
[77]
2018 | Journal Article | IST-REx-ID: 107
S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal of the ACM, vol. 65, no. 4, 2018.
View | DOI
 
[76]
2018 | Conference Paper | IST-REx-ID: 298   OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.
View | DOI | Download (ext.)
 
[75]
2017 | Conference Paper | IST-REx-ID: 605   OA
J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.
View | DOI | Download (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 559
H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.
View | Files available | DOI | Download (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 637   OA
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.
View | DOI | Download (ext.)
 
[72]
2017 | Journal Article | IST-REx-ID: 1187
E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4, pp. 1238–1275, 2017.
View | Files available | DOI
 
[71]
2017 | Conference Paper | IST-REx-ID: 640   OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.
View | DOI | Download (ext.)
 
[70]
2017 | Conference Paper | IST-REx-ID: 635   OA
J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.
View | DOI | Download (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 697   OA
K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 2017, vol. 80.
View | Files available | DOI
 
[68]
2017 | Journal Article | IST-REx-ID: 6196
P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, pp. 145–161, 2017.
View | Files available | DOI
 
[67]
2016 | Conference Paper | IST-REx-ID: 1231   OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
View | DOI | Download (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1229
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.
View | Files available | DOI
 
[65]
2016 | Conference Paper | IST-REx-ID: 1236
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.
View | Files available | DOI
 
[64]
2016 | Conference Paper | IST-REx-ID: 1179   OA
K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.
View | DOI | Download (ext.)
 
[63]
2016 | Conference Paper | IST-REx-ID: 1233   OA
G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.
View | DOI | Download (ext.)
 
[62]
2016 | Journal Article | IST-REx-ID: 1479
S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3, pp. 567–605, 2016.
View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1653   OA
T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.
View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1654   OA
P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.
View | Files available | DOI
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648   OA
G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction for generalized selective decryption on trees,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.
View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1650   OA
M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability ,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 1046–1057.
View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1649   OA
F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.
View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1675
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.
View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669   OA
K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.
View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671   OA
P. Gazi, K. Z. Pietrzak, and S. Tessaro, “The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9215, pp. 368–387.
View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1646   OA
A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic constrained pseudorandom functions,” vol. 9015. Springer, pp. 31–60, 2015.
View | Files available | DOI
 
[52]
2014 | Conference Paper | IST-REx-ID: 2082
P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.
View | Files available | DOI
 
[51]
2014 | Conference Paper | IST-REx-ID: 1927   OA
G. Fuchsbauer, M. Konstantinov, K. Z. Pietrzak, and V. Rao, “Adaptive security of constrained PRFs,” presented at the Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, vol. 8874, pp. 173–192.
View | DOI | Download (ext.)
 
[50]
2014 | Conference Paper | IST-REx-ID: 2236   OA
D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590.
View | Files available | DOI | Download (ext.)
 
[49]
2014 | Conference Paper | IST-REx-ID: 2185   OA
Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.
View | Files available | DOI
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3, pp. 397–428, 2014.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2219   OA
E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security from low noise LPN,” presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18.
View | DOI | Download (ext.)
 
[46]
2013 | Conference Paper | IST-REx-ID: 2258   OA
E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.
View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2259   OA
J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.
View | Files available | DOI
 
[44]
2013 | Report | IST-REx-ID: 2274   OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
View | Files available
 
[43]
2013 | Conference Paper | IST-REx-ID: 2940   OA
S. Krenn, K. Z. Pietrzak, and A. Wadia, “A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it,” presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan, 2013, vol. 7785, pp. 23–39.
View | Files available | DOI
 
[42]
2012 | Conference Paper | IST-REx-ID: 2049   OA
S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in Conference proceedings FSE 2012, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.
View | DOI | Download (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2974   OA
A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680.
View | Files available | DOI
 
[40]
2012 | Conference Paper | IST-REx-ID: 3282   OA
Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.
View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” Journal of Cryptology, vol. 25, no. 1, pp. 116–135, 2012.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3280   OA
K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.
View | DOI | Download (ext.)
 
[37]
2012 | Conference Paper | IST-REx-ID: 2048   OA
S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in Conference proceedings CHES 2012, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.
View | DOI | Download (ext.)
 
[36]
2012 | Conference Paper | IST-REx-ID: 3250
K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.
View | DOI
 
[35]
2012 | Conference Paper | IST-REx-ID: 3279
A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.
View | DOI | Download (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3281
K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.
View | DOI | Download (ext.)
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
B. Barak et al., “Leftover hash lemma revisited,” presented at the CRYPTO: International Cryptology Conference, 2011, vol. 6841, pp. 1–20.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3238
E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.
View | Files available | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3239
S. Faust, K. Z. Pietrzak, and D. Venturi, “Tamper proof circuits How to trade leakage for tamper resilience,” presented at the ICALP: Automata, Languages and Programming, 2011, vol. 6755, no. Part 1, pp. 391–402.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3236
A. Jain and K. Z. Pietrzak, “Parallel repetition for leakage resilience amplification revisited,” presented at the TCC: Theory of Cryptography Conference, 2011, vol. 6597, pp. 58–69.
View | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
E. Kiltz and K. Z. Pietrzak, “Leakage resilient ElGamal encryption,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, 2010, vol. 6477, pp. 595–612.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3233
J. Håstad, R. Pass, D. Wikström, and K. Z. Pietrzak, “An efficient parallel repetition theorem,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 1–18.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
S. Faust, E. Kiltz, K. Z. Pietrzak, and G. Rothblum, “Leakage resilient signatures,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 343–360.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3235
Y. Dodis and K. Z. Pietrzak, “Leakage resilient pseudorandom functions and side channel attacks on feistel networks,” presented at the CRYPTO: International Cryptology Conference, 2010, vol. 6223, pp. 21–40.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3232
K. Z. Pietrzak, “A leakage resilient mode of operation,” presented at the CRYPTO: International Cryptology Conference, 2009, vol. 5479, pp. 462–482.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3230
E. Kiltz, K. Z. Pietrzak, M. Stam, and M. Yung, “A new randomness extraction paradigm for hybrid encryption,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2009, vol. 5479, pp. 590–609.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3231
E. Kiltz and K. Z. Pietrzak, “On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2009, vol. 5479, pp. 389–406.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3225
M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi property combiners for hash functions revisited,” presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126, no. PART 2, pp. 655–666.
View | Files available | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3226
K. Z. Pietrzak and J. Sjödin, “Weak pseudorandom functions in minicrypt,” presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126, no. PART 2, pp. 423–436.
View | DOI
 
[20]
2008 | Journal Article | IST-REx-ID: 3227
P. Zubielik, J. Nadaczny, K. Z. Pietrzak, and M. Lawenda, “Elektrowiz – system of measurement data management,” Przeglad Elektrotechniczny, vol. 84, no. 10, pp. 239–242, 2008.
View | Download (ext.)
 
[19]
2008 | Conference Paper | IST-REx-ID: 3228
K. Z. Pietrzak, “Compression from collisions or why CRHF combiners have a long output,” presented at the CRYPTO: International Cryptology Conference, 2008, vol. 5157, pp. 413–432.
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
Y. Dodis, K. Z. Pietrzak, and P. Puniya, “A new mode of operation for block ciphers and length preserving MACs,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2008, vol. 4965, pp. 198–219.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3229
S. Dziembowski and K. Z. Pietrzak, “Leakage resilient cryptography,” presented at the FOCS: Foundations of Computer Science, 2008, pp. 293–302.
View | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
K. Z. Pietrzak, “Non-trivial black-box combiners for collision-resistant hash-functions don’t exist,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 23–33.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3220
S. Dziembowski and K. Z. Pietrzak, “Intrusion resilient secret sharing,” presented at the FOCS: Foundations of Computer Science, 2007, pp. 227–237.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3219
U. Maurer, K. Z. Pietrzak, and R. Renner, “Indistinguishability amplification,” presented at the CRYPTO: International Cryptology Conference, 2007, vol. 4622, pp. 130–149.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3221
K. Z. Pietrzak and J. Sjödin, “Range extension for weak PRFs the good the bad and the ugly,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 517–533.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3222
K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” presented at the TCC: Theory of Cryptography Conference, 2007, vol. 4392, pp. 86–102.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3223
Y. Dodis and K. Z. Pietrzak, “Improving the security of MACs via randomized message preprocessing,” presented at the FSE: Fast Software Encryption, 2007, vol. 4593, pp. 414–433.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
U. Maurer, Y. Oswald, K. Z. Pietrzak, and J. Sjödin, “Luby Rackoff ciphers from weak round functions ,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2006, vol. 4004, pp. 391–408.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Y. Dodis, K. Z. Pietrzak, and B. Przydatek, “Separating sources for encryption and secret sharing,” presented at the TCC: Theory of Cryptography Conference, 2006, vol. 3876, pp. 601–616.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3216
K. Z. Pietrzak, “A tight bound for EMAC,” presented at the ICALP: Automata, Languages and Programming, 2006, vol. 4052, pp. 168–179.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3217
K. Z. Pietrzak, “Composition implies adaptive security in minicrypt,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2006, vol. 4004, pp. 328–338.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3213
K. Z. Pietrzak, “Composition does not imply adaptive security,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 55–65.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3211
M. Bellare, K. Z. Pietrzak, and P. Rogaway, “Improved security analyses for CBC MACs,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 527–545.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3212
Y. Dodis, R. Oliveira, and K. Z. Pietrzak, “On the generic insecurity of the full domain hash,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 449–466.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak make one strong,” presented at the TCC: Theory of Cryptography Conference, 2004, vol. 2951, pp. 410–427.
View | DOI
 
[2]
2003 | Conference Paper | IST-REx-ID: 3210
U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561.
View | DOI
 
[1]
2003 | Journal Article | IST-REx-ID: 3209
K. Z. Pietrzak, “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, pp. 757–771, 2003.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed