Krzysztof Z Pietrzak

Pietrzak Group

85 Publications

Mark all

[85]
2019 | Conference Paper | IST-REx-ID: 6528   OA
Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
View | Files available | DOI | Download (ext.)
 
[84]
2019 | Conference Paper | IST-REx-ID: 6430
Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
View | DOI
 
[83]
2019 | Conference Paper | IST-REx-ID: 6677
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–1114.
View | DOI
 
[82]
2019 | Conference Paper | IST-REx-ID: 7411   OA
Reversible proofs of sequential work
H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.
View | DOI | Download (ext.)
 
[81]
2018 | Conference Paper | IST-REx-ID: 193   OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
[80]
2018 | Conference Paper | IST-REx-ID: 302   OA
Simple proofs of sequential work
B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.
View | DOI | Download (ext.)
 
[79]
2018 | Conference Paper | IST-REx-ID: 6941   OA
SpaceMint: A cryptocurrency based on proofs of space
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
View | DOI | Download (ext.)
 
[78]
2018 | Journal Article | IST-REx-ID: 107
Non-malleable codes
S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).
View | DOI
 
[77]
2018 | Conference Paper | IST-REx-ID: 7407   OA
Proofs of catalytic space
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
View | Files available | DOI | Download (ext.)
 
[76]
2018 | Conference Paper | IST-REx-ID: 298   OA
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
View | DOI | Download (ext.)
 
[75]
2017 | Conference Paper | IST-REx-ID: 605   OA
Position based cryptography and multiparty communication complexity
J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.
View | DOI | Download (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 559
Beyond Hellman’s time-memory trade-offs with applications to proofs of space
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
View | Files available | DOI | Download (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 637   OA
Be adaptive avoid overcommitting
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
View | DOI | Download (ext.)
 
[72]
2017 | Journal Article | IST-REx-ID: 1187
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.
View | Files available | DOI
 
[71]
2017 | Conference Paper | IST-REx-ID: 640   OA
Depth-robust graphs and their cumulative memory complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
View | DOI | Download (ext.)
 
[70]
2017 | Conference Paper | IST-REx-ID: 635   OA
Scrypt is maximally memory hard
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
View | DOI | Download (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 697   OA
Non uniform attacks against pseudoentropy
K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
[68]
2017 | Journal Article | IST-REx-ID: 6196
The exact security of PMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161.
View | Files available | DOI
 
[67]
2016 | Conference Paper | IST-REx-ID: 1231   OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
View | DOI | Download (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1229
Offline witness encryption
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.
View | Files available | DOI
 
[65]
2016 | Conference Paper | IST-REx-ID: 1236
Constrained PRFs for unbounded inputs
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.
View | Files available | DOI
 
[64]
2016 | Conference Paper | IST-REx-ID: 1179   OA
Pseudoentropy: Lower-bounds for chain rules and transformations
K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.
View | DOI | Download (ext.)
 
[63]
2016 | Conference Paper | IST-REx-ID: 1233   OA
Standard security does imply security against selective opening for markov distributions
G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.
View | DOI | Download (ext.)
 
[62]
2016 | Journal Article | IST-REx-ID: 1479
A counterexample to the chain rule for conditional HILL entropy
S. Krenn, K.Z. Pietrzak, A. Wadia, D. Wichs, Computational Complexity 25 (2016) 567–605.
View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1653   OA
New realizations of somewhere statistically binding hashing and positional accumulators
T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145.
View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1654   OA
Generic security of NMAC and HMAC with input whitening
P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.
View | Files available | DOI
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648   OA
A quasipolynomial reduction for generalized selective decryption on trees
G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.
View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1650   OA
Condensed unpredictability
M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.
View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1649   OA
Efficient zero-knowledge proofs for commitments from learning with errors over rings
F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.
View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1675
Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, 9216 (2015) 585–605.
View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669   OA
The chain rule for HILL pseudoentropy, revisited
K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.
View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671   OA
The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC
P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.
View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1646   OA
Key-homomorphic constrained pseudorandom functions
A. Banerjee, G. Fuchsbauer, C. Peikert, K.Z. Pietrzak, S. Stevens, 9015 (2015) 31–60.
View | Files available | DOI
 
[52]
2014 | Conference Paper | IST-REx-ID: 2082
The exact PRF-security of NMAC and HMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.
View | Files available | DOI
 
[51]
2014 | Conference Paper | IST-REx-ID: 1927   OA
Adaptive security of constrained PRFs
G. Fuchsbauer, M. Konstantinov, K.Z. Pietrzak, V. Rao, in:, Springer, 2014, pp. 173–192.
View | DOI | Download (ext.)
 
[50]
2014 | Conference Paper | IST-REx-ID: 2185   OA
Key derivation without entropy waste
Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.
View | Files available | DOI
 
[49]
2014 | Conference Paper | IST-REx-ID: 2236   OA
How to fake auxiliary input
D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.
View | Files available | DOI | Download (ext.)
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
Robust multi-property combiners for hash functions
M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2219   OA
Simple chosen-ciphertext security from low noise LPN
E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.
View | DOI | Download (ext.)
 
[46]
2013 | Conference Paper | IST-REx-ID: 2258   OA
Digital signatures with minimal overhead from indifferentiable random invertible functions
E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.
View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
View | Files available | DOI
 
[44]
2013 | Report | IST-REx-ID: 2274   OA
Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.
View | Files available
 
[43]
2013 | Conference Paper | IST-REx-ID: 2940   OA
A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it
S. Krenn, K.Z. Pietrzak, A. Wadia, in:, A. Sahai (Ed.), Springer, 2013, pp. 23–39.
View | Files available | DOI
 
[42]
2012 | Conference Paper | IST-REx-ID: 2049   OA
Lapin: An efficient authentication protocol based on ring-LPN
S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.
View | DOI | Download (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2974   OA
Commitments and efficient zero knowledge proofs from learning parity with noise
A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.
View | Files available | DOI
 
[40]
2012 | Conference Paper | IST-REx-ID: 3282   OA
Message authentication, revisited
Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.
View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
Parallel repetition of computationally sound protocols revisited
K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3280   OA
Subspace LWE
K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.
View | DOI | Download (ext.)
 
[37]
2012 | Conference Paper | IST-REx-ID: 2048   OA
Practical leakage-resilient symmetric cryptography
S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.
View | DOI | Download (ext.)
 
[36]
2012 | Conference Paper | IST-REx-ID: 3279
Hardness preserving constructions of pseudorandom functions
A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.
View | DOI | Download (ext.)
 
[35]
2012 | Conference Paper | IST-REx-ID: 3281
Lossy functions do not amplify well
K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.
View | DOI | Download (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3250
Cryptography from learning parity with noise
K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114.
View | DOI
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
Leftover hash lemma revisited
B. Barak, Y. Dodis, H. Krawczyk, O. Pereira, K.Z. Pietrzak, F. Standaert, Y. Yu, in:, Springer, 2011, pp. 1–20.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3238
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.
View | Files available | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3239
Tamper proof circuits How to trade leakage for tamper resilience
S. Faust, K.Z. Pietrzak, D. Venturi, in:, Springer, 2011, pp. 391–402.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3236
Parallel repetition for leakage resilience amplification revisited
A. Jain, K.Z. Pietrzak, in:, Springer, 2011, pp. 58–69.
View | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
Leakage resilient ElGamal encryption
E. Kiltz, K.Z. Pietrzak, in:, Springer, 2010, pp. 595–612.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3233
An efficient parallel repetition theorem
J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, pp. 1–18.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
Leakage resilient signatures
S. Faust, E. Kiltz, K.Z. Pietrzak, G. Rothblum, in:, Springer, 2010, pp. 343–360.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3235
Leakage resilient pseudorandom functions and side channel attacks on feistel networks
Y. Dodis, K.Z. Pietrzak, in:, Springer, 2010, pp. 21–40.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3232
A leakage resilient mode of operation
K.Z. Pietrzak, in:, Springer, 2009, pp. 462–482.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3230
A new randomness extraction paradigm for hybrid encryption
E. Kiltz, K.Z. Pietrzak, M. Stam, M. Yung, in:, Springer, 2009, pp. 590–609.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3231
On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model
E. Kiltz, K.Z. Pietrzak, in:, Springer, 2009, pp. 389–406.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3225
Robust multi property combiners for hash functions revisited
M. Fischlin, A. Lehmann, K.Z. Pietrzak, in:, Springer, 2008, pp. 655–666.
View | Files available | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3226
Weak pseudorandom functions in minicrypt
K.Z. Pietrzak, J. Sjödin, in:, Springer, 2008, pp. 423–436.
View | DOI
 
[20]
2008 | Journal Article | IST-REx-ID: 3227
Elektrowiz – system of measurement data management
P. Zubielik, J. Nadaczny, K.Z. Pietrzak, M. Lawenda, Przeglad Elektrotechniczny 84 (2008) 239–242.
View | Download (ext.)
 
[19]
2008 | Conference Paper | IST-REx-ID: 3228
Compression from collisions or why CRHF combiners have a long output
K.Z. Pietrzak, in:, Springer, 2008, pp. 413–432.
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
A new mode of operation for block ciphers and length preserving MACs
Y. Dodis, K.Z. Pietrzak, P. Puniya, in:, Springer, 2008, pp. 198–219.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3229
Leakage resilient cryptography
S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2008, pp. 293–302.
View | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
Non-trivial black-box combiners for collision-resistant hash-functions don't exist
K.Z. Pietrzak, in:, Springer, 2007, pp. 23–33.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3220
Intrusion resilient secret sharing
S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2007, pp. 227–237.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3219
Indistinguishability amplification
U. Maurer, K.Z. Pietrzak, R. Renner, in:, Springer, 2007, pp. 130–149.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3221
Range extension for weak PRFs the good the bad and the ugly
K.Z. Pietrzak, J. Sjödin, in:, Springer, 2007, pp. 517–533.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3222
Parallel repetition of computationally sound protocols revisited
K.Z. Pietrzak, D. Wikström, in:, Springer, 2007, pp. 86–102.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3223
Improving the security of MACs via randomized message preprocessing
Y. Dodis, K.Z. Pietrzak, in:, Springer, 2007, pp. 414–433.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
Luby Rackoff ciphers from weak round functions
U. Maurer, Y. Oswald, K.Z. Pietrzak, J. Sjödin, in:, Springer, 2006, pp. 391–408.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Separating sources for encryption and secret sharing
Y. Dodis, K.Z. Pietrzak, B. Przydatek, in:, Springer, 2006, pp. 601–616.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3216
A tight bound for EMAC
K.Z. Pietrzak, in:, Springer, 2006, pp. 168–179.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3217
Composition implies adaptive security in minicrypt
K.Z. Pietrzak, in:, Springer, 2006, pp. 328–338.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3213
Composition does not imply adaptive security
K.Z. Pietrzak, in:, Springer, 2005, pp. 55–65.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3211
Improved security analyses for CBC MACs
M. Bellare, K.Z. Pietrzak, P. Rogaway, in:, Springer, 2005, pp. 527–545.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3212
On the generic insecurity of the full domain hash
Y. Dodis, R. Oliveira, K.Z. Pietrzak, in:, Springer, 2005, pp. 449–466.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
Composition of random systems: When two weak make one strong
U. Maurer, K.Z. Pietrzak, in:, Springer, 2004, pp. 410–427.
View | DOI
 
[2]
2003 | Conference Paper | IST-REx-ID: 3210
The security of many round Luby Rackoff pseudo random permutations
U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.
View | DOI
 
[1]
2003 | Journal Article | IST-REx-ID: 3209
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

85 Publications

Mark all

[85]
2019 | Conference Paper | IST-REx-ID: 6528   OA
Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
View | Files available | DOI | Download (ext.)
 
[84]
2019 | Conference Paper | IST-REx-ID: 6430
Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
View | DOI
 
[83]
2019 | Conference Paper | IST-REx-ID: 6677
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–1114.
View | DOI
 
[82]
2019 | Conference Paper | IST-REx-ID: 7411   OA
Reversible proofs of sequential work
H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.
View | DOI | Download (ext.)
 
[81]
2018 | Conference Paper | IST-REx-ID: 193   OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
[80]
2018 | Conference Paper | IST-REx-ID: 302   OA
Simple proofs of sequential work
B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.
View | DOI | Download (ext.)
 
[79]
2018 | Conference Paper | IST-REx-ID: 6941   OA
SpaceMint: A cryptocurrency based on proofs of space
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
View | DOI | Download (ext.)
 
[78]
2018 | Journal Article | IST-REx-ID: 107
Non-malleable codes
S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).
View | DOI
 
[77]
2018 | Conference Paper | IST-REx-ID: 7407   OA
Proofs of catalytic space
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
View | Files available | DOI | Download (ext.)
 
[76]
2018 | Conference Paper | IST-REx-ID: 298   OA
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
View | DOI | Download (ext.)
 
[75]
2017 | Conference Paper | IST-REx-ID: 605   OA
Position based cryptography and multiparty communication complexity
J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.
View | DOI | Download (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 559
Beyond Hellman’s time-memory trade-offs with applications to proofs of space
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
View | Files available | DOI | Download (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 637   OA
Be adaptive avoid overcommitting
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
View | DOI | Download (ext.)
 
[72]
2017 | Journal Article | IST-REx-ID: 1187
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.
View | Files available | DOI
 
[71]
2017 | Conference Paper | IST-REx-ID: 640   OA
Depth-robust graphs and their cumulative memory complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
View | DOI | Download (ext.)
 
[70]
2017 | Conference Paper | IST-REx-ID: 635   OA
Scrypt is maximally memory hard
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
View | DOI | Download (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 697   OA
Non uniform attacks against pseudoentropy
K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
[68]
2017 | Journal Article | IST-REx-ID: 6196
The exact security of PMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161.
View | Files available | DOI
 
[67]
2016 | Conference Paper | IST-REx-ID: 1231   OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
View | DOI | Download (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1229
Offline witness encryption
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.
View | Files available | DOI
 
[65]
2016 | Conference Paper | IST-REx-ID: 1236
Constrained PRFs for unbounded inputs
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.
View | Files available | DOI
 
[64]
2016 | Conference Paper | IST-REx-ID: 1179   OA
Pseudoentropy: Lower-bounds for chain rules and transformations
K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.
View | DOI | Download (ext.)
 
[63]
2016 | Conference Paper | IST-REx-ID: 1233   OA
Standard security does imply security against selective opening for markov distributions
G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.
View | DOI | Download (ext.)
 
[62]
2016 | Journal Article | IST-REx-ID: 1479
A counterexample to the chain rule for conditional HILL entropy
S. Krenn, K.Z. Pietrzak, A. Wadia, D. Wichs, Computational Complexity 25 (2016) 567–605.
View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1653   OA
New realizations of somewhere statistically binding hashing and positional accumulators
T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145.
View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1654   OA
Generic security of NMAC and HMAC with input whitening
P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.
View | Files available | DOI
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648   OA
A quasipolynomial reduction for generalized selective decryption on trees
G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.
View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1650   OA
Condensed unpredictability
M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.
View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1649   OA
Efficient zero-knowledge proofs for commitments from learning with errors over rings
F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.
View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1675
Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, 9216 (2015) 585–605.
View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669   OA
The chain rule for HILL pseudoentropy, revisited
K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.
View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671   OA
The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC
P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.
View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1646   OA
Key-homomorphic constrained pseudorandom functions
A. Banerjee, G. Fuchsbauer, C. Peikert, K.Z. Pietrzak, S. Stevens, 9015 (2015) 31–60.
View | Files available | DOI
 
[52]
2014 | Conference Paper | IST-REx-ID: 2082
The exact PRF-security of NMAC and HMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.
View | Files available | DOI
 
[51]
2014 | Conference Paper | IST-REx-ID: 1927   OA
Adaptive security of constrained PRFs
G. Fuchsbauer, M. Konstantinov, K.Z. Pietrzak, V. Rao, in:, Springer, 2014, pp. 173–192.
View | DOI | Download (ext.)
 
[50]
2014 | Conference Paper | IST-REx-ID: 2185   OA
Key derivation without entropy waste
Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.
View | Files available | DOI
 
[49]
2014 | Conference Paper | IST-REx-ID: 2236   OA
How to fake auxiliary input
D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.
View | Files available | DOI | Download (ext.)
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
Robust multi-property combiners for hash functions
M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2219   OA
Simple chosen-ciphertext security from low noise LPN
E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.
View | DOI | Download (ext.)
 
[46]
2013 | Conference Paper | IST-REx-ID: 2258   OA
Digital signatures with minimal overhead from indifferentiable random invertible functions
E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.
View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
View | Files available | DOI
 
[44]
2013 | Report | IST-REx-ID: 2274   OA
Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.
View | Files available
 
[43]
2013 | Conference Paper | IST-REx-ID: 2940   OA
A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it
S. Krenn, K.Z. Pietrzak, A. Wadia, in:, A. Sahai (Ed.), Springer, 2013, pp. 23–39.
View | Files available | DOI
 
[42]
2012 | Conference Paper | IST-REx-ID: 2049   OA
Lapin: An efficient authentication protocol based on ring-LPN
S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.
View | DOI | Download (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2974   OA
Commitments and efficient zero knowledge proofs from learning parity with noise
A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.
View | Files available | DOI
 
[40]
2012 | Conference Paper | IST-REx-ID: 3282   OA
Message authentication, revisited
Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.
View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
Parallel repetition of computationally sound protocols revisited
K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3280   OA
Subspace LWE
K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.
View | DOI | Download (ext.)
 
[37]
2012 | Conference Paper | IST-REx-ID: 2048   OA
Practical leakage-resilient symmetric cryptography
S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.
View | DOI | Download (ext.)
 
[36]
2012 | Conference Paper | IST-REx-ID: 3279
Hardness preserving constructions of pseudorandom functions
A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.
View | DOI | Download (ext.)
 
[35]
2012 | Conference Paper | IST-REx-ID: 3281
Lossy functions do not amplify well
K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.
View | DOI | Download (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3250
Cryptography from learning parity with noise
K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114.
View | DOI
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
Leftover hash lemma revisited
B. Barak, Y. Dodis, H. Krawczyk, O. Pereira, K.Z. Pietrzak, F. Standaert, Y. Yu, in:, Springer, 2011, pp. 1–20.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3238
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.
View | Files available | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3239
Tamper proof circuits How to trade leakage for tamper resilience
S. Faust, K.Z. Pietrzak, D. Venturi, in:, Springer, 2011, pp. 391–402.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3236
Parallel repetition for leakage resilience amplification revisited
A. Jain, K.Z. Pietrzak, in:, Springer, 2011, pp. 58–69.
View | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
Leakage resilient ElGamal encryption
E. Kiltz, K.Z. Pietrzak, in:, Springer, 2010, pp. 595–612.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3233
An efficient parallel repetition theorem
J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, pp. 1–18.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
Leakage resilient signatures
S. Faust, E. Kiltz, K.Z. Pietrzak, G. Rothblum, in:, Springer, 2010, pp. 343–360.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3235
Leakage resilient pseudorandom functions and side channel attacks on feistel networks
Y. Dodis, K.Z. Pietrzak, in:, Springer, 2010, pp. 21–40.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3232
A leakage resilient mode of operation
K.Z. Pietrzak, in:, Springer, 2009, pp. 462–482.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3230
A new randomness extraction paradigm for hybrid encryption
E. Kiltz, K.Z. Pietrzak, M. Stam, M. Yung, in:, Springer, 2009, pp. 590–609.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3231
On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model
E. Kiltz, K.Z. Pietrzak, in:, Springer, 2009, pp. 389–406.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3225
Robust multi property combiners for hash functions revisited
M. Fischlin, A. Lehmann, K.Z. Pietrzak, in:, Springer, 2008, pp. 655–666.
View | Files available | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3226
Weak pseudorandom functions in minicrypt
K.Z. Pietrzak, J. Sjödin, in:, Springer, 2008, pp. 423–436.
View | DOI
 
[20]
2008 | Journal Article | IST-REx-ID: 3227
Elektrowiz – system of measurement data management
P. Zubielik, J. Nadaczny, K.Z. Pietrzak, M. Lawenda, Przeglad Elektrotechniczny 84 (2008) 239–242.
View | Download (ext.)
 
[19]
2008 | Conference Paper | IST-REx-ID: 3228
Compression from collisions or why CRHF combiners have a long output
K.Z. Pietrzak, in:, Springer, 2008, pp. 413–432.
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
A new mode of operation for block ciphers and length preserving MACs
Y. Dodis, K.Z. Pietrzak, P. Puniya, in:, Springer, 2008, pp. 198–219.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3229
Leakage resilient cryptography
S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2008, pp. 293–302.
View | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
Non-trivial black-box combiners for collision-resistant hash-functions don't exist
K.Z. Pietrzak, in:, Springer, 2007, pp. 23–33.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3220
Intrusion resilient secret sharing
S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2007, pp. 227–237.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3219
Indistinguishability amplification
U. Maurer, K.Z. Pietrzak, R. Renner, in:, Springer, 2007, pp. 130–149.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3221
Range extension for weak PRFs the good the bad and the ugly
K.Z. Pietrzak, J. Sjödin, in:, Springer, 2007, pp. 517–533.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3222
Parallel repetition of computationally sound protocols revisited
K.Z. Pietrzak, D. Wikström, in:, Springer, 2007, pp. 86–102.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3223
Improving the security of MACs via randomized message preprocessing
Y. Dodis, K.Z. Pietrzak, in:, Springer, 2007, pp. 414–433.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
Luby Rackoff ciphers from weak round functions
U. Maurer, Y. Oswald, K.Z. Pietrzak, J. Sjödin, in:, Springer, 2006, pp. 391–408.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Separating sources for encryption and secret sharing
Y. Dodis, K.Z. Pietrzak, B. Przydatek, in:, Springer, 2006, pp. 601–616.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3216
A tight bound for EMAC
K.Z. Pietrzak, in:, Springer, 2006, pp. 168–179.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3217
Composition implies adaptive security in minicrypt
K.Z. Pietrzak, in:, Springer, 2006, pp. 328–338.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3213
Composition does not imply adaptive security
K.Z. Pietrzak, in:, Springer, 2005, pp. 55–65.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3211
Improved security analyses for CBC MACs
M. Bellare, K.Z. Pietrzak, P. Rogaway, in:, Springer, 2005, pp. 527–545.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3212
On the generic insecurity of the full domain hash
Y. Dodis, R. Oliveira, K.Z. Pietrzak, in:, Springer, 2005, pp. 449–466.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
Composition of random systems: When two weak make one strong
U. Maurer, K.Z. Pietrzak, in:, Springer, 2004, pp. 410–427.
View | DOI
 
[2]
2003 | Conference Paper | IST-REx-ID: 3210
The security of many round Luby Rackoff pseudo random permutations
U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.
View | DOI
 
[1]
2003 | Journal Article | IST-REx-ID: 3209
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed