Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




88 Publications

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, p. 60.
View | Files available | DOI | Download (ext.)
 
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
 
2019 | Book Chapter | IST-REx-ID: 6726
Sampling the integers with low relative error
M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 5887
Per-session security: Password-based cryptography revisited
G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 7136   OA
Strong chain rules for min-entropy under few bits spoiled
M. Skórski, in:, 2019 IEEE International Symposium on Information Theory, IEEE, 2019, p. 8849240.
View | DOI | Download (ext.) | arXiv
 
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
 
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.)
 
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.)
 
2018 | Journal Article | IST-REx-ID: 5980
Private set-intersection with common set-up
S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.
View | DOI
 
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.)
 
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
 
2018 | Conference Paper | IST-REx-ID: 108   OA
Inverted leftover hash lemma
M. Obremski, M. Skorski, in:, IEEE, 2018.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 300   OA
On the bit security of cryptographic primitives
D. Micciancio, M. Walter, in:, M. Walter (Ed.), Springer, 2018, pp. 3–28.
View | DOI | Download (ext.)
 
2018 | Thesis | IST-REx-ID: 83   OA
Proof systems for sustainable decentralized cryptocurrencies
H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, IST Austria, 2018.
View | Files available | DOI
 
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.)
 
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.)
 
2017 | Conference Paper | IST-REx-ID: 648   OA
On the complexity of breaking pseudoentropy
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 650   OA
A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6527   OA
Practical graphs for optimal side-channel resistant memory-hard functions
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
View | DOI | Download (ext.)
 
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.)
 

Search

Filter Publications

Display / Sort

Export / Embed