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
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124.
View | Files available | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6430
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443. 317–346.
View | DOI
 
2019 | Book Chapter | IST-REx-ID: 6726
Walter M. 2019. Sampling the integers with low relative error. Progress in Cryptology – AFRICACRYPT 2019. International Conference on Cryptology in AfricaLNCS vol. 11627. 157–180.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 5887
Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 7136   OA
Skórski M. 2019. Strong chain rules for min-entropy under few bits spoiled. 2019 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6677
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. STOC: Symposium on Theory of Computing 1103–1114.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 302   OA
Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821. 451–467.
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 6941   OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957. 480–499.
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 107
Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 108   OA
Obremski M, Skorski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.
View | DOI | Download (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.
View | DOI | Download (ext.)
 
2018 | Thesis | IST-REx-ID: 83   OA
Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies, IST Austria, 59p.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821. 99–130.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 605   OA
Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677. 56–81.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 648   OA
Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185. 600–613.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 650   OA
Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185. 586–599.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6527   OA
Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security 1001–1017.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625. 357–379.
View | Files available | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed