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.




9 Publications

2021 | Conference Paper | IST-REx-ID: 9466 | OA
Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67.
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10407 | OA
Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. 2021. Trojan-resilience without cryptography. TCC: Theory of Cryptography Conference, LNCS, vol. 13043, 397–428.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 550–581.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference.
[Preprint] View | Files available | Download Preprint (ext.)
 
2018 | Conference Paper | IST-REx-ID: 300 | OA
Micciancio D, Walter M. 2018. On the bit security of cryptographic primitives. Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2016 | Conference Paper | IST-REx-ID: 1179 | OA
Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 183–203.
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1474 | OA
Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic access control. CSF: Computer Security Foundations, 46–60.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1652 | OA
Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard functions. Proceedings of the 47th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 595–603.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

type%3C%3Eresearch_data

Search

Filter Publications