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.




94 Publications

2020 | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg C. 2020. On the average-case hardness of total search problems, IST Austria, 126p.
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 7966 | OA
Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 12107. 475–506.
View | DOI | Download Submitted Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 8322
Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171. 732–762.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 8339 | OA
Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110. 623–651.
View | DOI | Download Preprint (ext.)
 
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 Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477. 277–291.
View | DOI | Download Submitted Version (ext.)
 
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: 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 | 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 Published Version (ext.)
 
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 | Files available | 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
 
2018 | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124. 59:1-59:25.
View | Files available | DOI | Download Published Version (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: 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 Preprint (ext.) | arXiv
 
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 Submitted Version (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 Submitted Version (ext.)
 
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 Submitted Version (ext.)
 
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 Submitted Version (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 | 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 Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 559 | OA
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 Submitted Version (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 Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 609 | OA
Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677. 493–526.
View | DOI | Download Submitted Version (ext.)
 
2017 | Journal Article | IST-REx-ID: 6196 | OA
Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 145–161.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 635 | OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 33–62.
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401. 133–163.
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 640 | OA
Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 3–32.
View | DOI | Download Submitted Version (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 Submitted Version (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 Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6526 | OA
Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory
View | DOI | Download Preprint (ext.) | arXiv
 
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 Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 80.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 710 | OA
Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, LIPIcs, vol. 81.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 838 | OA
Rybar M. 2017. (The exact security of) Message authentication codes, IST Austria, 86p.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1187 | OA
Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1174 | OA
Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66.
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1175 | OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67. 38:1-38-21.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1176 | OA
Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy
View | DOI | Download Submitted Version (ext.)
 
2016 | Journal Article | IST-REx-ID: 1592
Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. 2016. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 29(2), 363–421.
View | DOI
 
2016 | Conference Paper | IST-REx-ID: 1653 | OA
Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452. 121–145.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1225 | OA
Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. 2016. Practical round-optimal blind signatures in the standard model from weaker assumptions. SCN: Security and Cryptography for Networks, LNCS, vol. 9841. 391–408.
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1229 | OA
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696. 285–303.
View | Files available | DOI
 
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.
View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1233 | OA
Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562. 282–305.
View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1235 | OA
Abusalah HM, Fuchsbauer G. 2016. Constrained PRFs for unbounded inputs with short keys. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696. 445–463.
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1236 | OA
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Constrained PRFs for unbounded inputs. CT-RSA: Topics in Cryptology, LNCS, vol. 9610. 413–428.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1365 | OA
Alwen JF, Blocki J. 2016. Efficiently computing data-independent memory-hard functions. CRYPTO: International Cryptology Conference, LNCS, vol. 9815. 241–271.
View | DOI | Download Preprint (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1366 | OA
Gazi P, Tessaro S. 2016. Provably robust sponge-based PRNGs and KDFs. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9665. 87–116.
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1479 | OA
Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.
View | Files available | DOI
 

Search

Display / Sort

Citation Style: IST Annual Report

Export / Embed