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 | Conference Paper | IST-REx-ID: 7966 | OA
Auerbach, B., Giacon, F., & Kiltz, E. (2020). Everybody’s a target: Scalability in public-key encryption. In Advances in Cryptology – EUROCRYPT 2020 (Vol. 12107, pp. 475–506). Springer Nature. https://doi.org/10.1007/978-3-030-45727-3_16
View | DOI | Download Submitted Version (ext.)
 
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. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21
View | DOI | Download Preprint (ext.)
 
2020 | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg, C. (2020). On the average-case hardness of total search problems. IST Austria. https://doi.org/10.15479/AT:ISTA:7896
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 8322 | OA
Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26
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. In 2019 IEEE International Symposium on Information Theory. Paris, France: IEEE. https://doi.org/10.1109/isit.2019.8849240
View | DOI | Download Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2019). Reversible proofs of sequential work. In Advances in Cryptology – EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing. https://doi.org/10.1007/978-3-030-17656-3_10
View | DOI | Download Submitted Version (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6528 | OA
Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60
View | Files available | DOI | Download Published Version (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer, G., Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2019). Adaptively secure proxy re-encryption (Vol. 11443, pp. 317–346). Presented at the PKC: Public-Key Cryptograhy, Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-030-17259-6_11
View | DOI | Download Preprint (ext.)
 
2019 | Book Chapter | IST-REx-ID: 6726 | OA
Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9
View | DOI | Download Preprint (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri, A. R., Hubáček, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen, A., & Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3313276.3316400
View | Files available | DOI | Download Preprint (ext.)
 
2019 | Journal Article | IST-REx-ID: 5887 | OA
Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security, 27(1), 75–111. https://doi.org/10.3233/JCS-181131
View | DOI | Download Preprint (ext.)
 
2018 | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59
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. https://doi.org/10.3934/amc.2018002
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 298 | OA
Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 302 | OA
Cohen, B., & Pietrzak, K. Z. (2018). Simple proofs of sequential work (Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_15
View | DOI | Download Submitted Version (ext.)
 
2018 | Conference Paper | IST-REx-ID: 6941 | OA
Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26
View | DOI | Download Submitted Version (ext.)
 
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534
View | DOI | Download Submitted Version (ext.)
 
2018 | Thesis | IST-REx-ID: 83 | OA
Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies. IST Austria. https://doi.org/10.15479/AT:ISTA:TH_1046
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 108 | OA
Obremski, M., & Skorski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. https://doi.org/10.1109/ISIT.2018.8437654
View | DOI | Download Submitted Version (ext.)
 
2018 | Journal Article | IST-REx-ID: 107 | OA
Dziembowski, S., Pietrzak, K. Z., & Wichs, D. (2018). Non-malleable codes. Journal of the ACM, 65(4). https://doi.org/10.1145/3178432
View | DOI | Download Preprint (ext.)
 
2018 | Conference Paper | IST-REx-ID: 300 | OA
Micciancio, D., & Walter, M. (2018). On the bit security of cryptographic primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78381-9_1
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 559 | OA
Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., & Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. https://doi.org/10.1007/978-3-319-70697-9_13
View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 605 | OA
Brody, J., Dziembowski, S., Faust, S., & Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_3
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 609 | OA
Alwen, J. F., & Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_17
View | DOI | Download Submitted Version (ext.)
 
2017 | Journal Article | IST-REx-ID: 6196 | OA
Gazi, P., Pietrzak, K. Z., & Rybar, M. (2017). The exact security of PMAC. IACR Transactions on Symmetric Cryptology, 2016(2), 145–161. https://doi.org/10.13154/TOSC.V2016.I2.145-161
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 635 | OA
Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., & Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz & H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-319-63688-7_5
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 640 | OA
Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 648 | OA
Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43
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. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42
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. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE. https://doi.org/10.1109/isit.2017.8006529
View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 6527 | OA
Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak, K. Z., & Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2017.39
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 710 | OA
Obremski, M., & Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 838 | OA
Rybar, M. (2017). (The exact security of) Message authentication codes. IST Austria. https://doi.org/10.15479/AT:ISTA:th_828
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1187 | OA
Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., & Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology, 30(4), 1238–1275. https://doi.org/10.1007/s00145-016-9247-3
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 (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2017.57
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1175 | OA
Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1176 | OA
Alwen, J. F., & Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France: IEEE. https://doi.org/10.1109/EuroSP.2017.47
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. https://doi.org/10.1007/s00145-014-9196-7
View | DOI
 
2016 | Conference Paper | IST-REx-ID: 1653 | OA
Okamoto, T., Pietrzak, K. Z., Waters, B., & Wichs, D. (2016). New realizations of somewhere statistically binding hashing and positional accumulators (Vol. 9452, pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48797-6_6
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 (Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy: Springer. https://doi.org/10.1007/978-3-319-44618-9_21
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1229 | OA
Abusalah, H. M., Fuchsbauer, G., & Pietrzak, K. Z. (2016). Offline witness encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. https://doi.org/10.1007/978-3-319-39555-5_16
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., & Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-662-49896-5_13
View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1233 | OA
Fuchsbauer, G., Heuer, F., Kiltz, E., & Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-662-49096-9_12
View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1235 | OA
Abusalah, H. M., & Fuchsbauer, G. (2016). Constrained PRFs for unbounded inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. https://doi.org/10.1007/978-3-319-39555-5_24
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1236 | OA
Abusalah, H. M., Fuchsbauer, G., & Pietrzak, K. Z. (2016). Constrained PRFs for unbounded inputs (Vol. 9610, pp. 413–428). Presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-29485-8_24
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1365 | OA
Alwen, J. F., & Blocki, J. (2016). Efficiently computing data-independent memory-hard functions (Vol. 9815, pp. 241–271). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer. https://doi.org/10.1007/978-3-662-53008-5_9
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 (Vol. 9665, pp. 87–116). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-662-49890-3_4
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1479 | OA
Krenn, S., Pietrzak, K. Z., Wadia, A., & Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. Computational Complexity, 25(3), 567–605. https://doi.org/10.1007/s00037-015-0120-9
View | Files available | DOI
 

Search

Display / Sort

Citation Style: APA

Export / Embed