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

2018 | Journal Article | IST-REx-ID: 107 | OA
Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4).
View | DOI | Download Preprint (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
 
2016 | Journal Article | IST-REx-ID: 1177 | OA
Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.
View | DOI | Download Submitted Version (ext.)
 
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.
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1644 | OA
Demay G, Gazi P, Maurer U, Tackmann B. 2015. Query-complexity amplification for random oracles. ICITS: International Conference on Information Theoretic Security, LNCS, vol. 9063. 159–180.
View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1645
Gazi P, Tessaro S. 2015. Secret-key cryptography from ideal primitives: A systematic verview. 2015 IEEE Information Theory Workshop. ITW 2015: IEEE Information Theory Workshop
View | DOI
 
2015 | Conference Paper | IST-REx-ID: 1646 | OA
Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. 2015. Key-homomorphic constrained pseudorandom functions. 9015, 31–60.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1647 | OA
Fuchsbauer G, Hanser C, Slamanig D. 2015. Practical round-optimal blind signatures in the standard model. CRYPTO: International Cryptology Conference, LNCS, vol. 9216. 233–253.
View | Files available | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1648 | OA
Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction for generalized selective decryption on trees. CRYPTO: International Cryptology Conference, LNCS, vol. 9215. 601–620.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1649 | OA
Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 9326, 305–325.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1650 | OA
Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP: Automata, Languages and Programming, LNCS, vol. 9134. 1046–1057.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1651
Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable e-cash. PKC: Public Key Crypography, LNCS, vol. 9020. 101–124.
View | DOI
 
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.
View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1654 | OA
Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with input whitening. 9453, 85–109.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1668 | OA
Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. 2015. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 9054, 319–341.
View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1669 | OA
Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1671 | OA
Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology Conference, LNCS, vol. 9215. 368–387.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1672 | OA
Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation and universally composable receipt-free voting. 9216, 763–780.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 9216, 585–605.
View | Files available | DOI
 
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.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2045 | OA
Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. 2014. Enhanced chosen-ciphertext security and applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol. 8383. 329–344.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2046 | OA
Bellare M, Fuchsbauer G. 2014. Policy-based signatures. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol. 8383. 520–537.
View | DOI | Download Submitted Version (ext.)
 

Search

Display / Sort

Citation Style: IST Annual Report

Export / Embed