Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

126 Publications


2017 | Published | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | 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, 8006529.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | 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, 57.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | 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.
[Published Version] View | Files available | DOI
 

2017 | Published | 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, 7961977.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | 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.
[Submitted Version] View | Files available | DOI | WoS
 

2016 | Published | 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2016 | Published | 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.
[Submitted Version] View | Files available | DOI
 

2016 | Published | 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.)
 

2016 | Published | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2016 | Published | 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2016 | Published | 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.
[Submitted Version] View | Files available | DOI
 

2016 | Published | 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.
[Submitted Version] View | Files available | DOI
 

2016 | Published | 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 | Published | 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.
[Submitted Version] View | Files available | DOI
 

Filters and Search Terms

department=KrPi

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed