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.
135 Publications
2016 | Published | Conference Paper | IST-REx-ID: 1365 | 
J. F. Alwen and J. Blocki, “Efficiently computing data-independent memory-hard functions,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2016, vol. 9815, pp. 241–271.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1366 |
P. Gazi and S. Tessaro, “Provably robust sponge-based PRNGs and KDFs,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9665, pp. 87–116.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Published | Journal Article | IST-REx-ID: 1177 |
C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound,” Algorithmica, vol. 74, no. 4. Springer, pp. 1321–1362, 2016.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1179 |
K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1653 |
T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.
[Submitted Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1225 |
G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, and D. Slamanig, “Practical round-optimal blind signatures in the standard model from weaker assumptions,” presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy, 2016, vol. 9841, pp. 391–408.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1231 |
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1233 |
G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 | Published | Journal Article | IST-REx-ID: 1479 |
S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3. Springer, pp. 567–605, 2016.
[Submitted Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1229 |
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.
[Submitted Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1236 |
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.
[Submitted Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1235 |
H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs with short keys,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 445–463.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1644 |
G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Query-complexity amplification for random oracles,” presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland, 2015, vol. 9063, pp. 159–180.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1646 |
A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic constrained pseudorandom functions,” in 12th Theory of Cryptography Conference, Warsaw, Poland, 2015, vol. 9015, pp. 31–60.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1647 |
G. Fuchsbauer, C. Hanser, and D. Slamanig, “Practical round-optimal blind signatures in the standard model,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 233–253.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1648 |
G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction for generalized selective decryption on trees,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.
[Submitted Version]
View
| Files available
| DOI
2015 | Published | Conference Paper | IST-REx-ID: 1649 |
F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.
[Published Version]
View
| Files available
| DOI
2015 | Published | Conference Paper | IST-REx-ID: 1650 |
M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability ,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 1046–1057.
[Published Version]
View
| Files available
| DOI