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.
126 Publications
2016 |
Published |
Conference Paper |
IST-REx-ID: 1365 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1366 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Journal Article |
IST-REx-ID: 1177 |
Kamath Hosdurg, C., & Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. Springer. https://doi.org/10.1007/s00453-015-9997-6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1179 |
Pietrzak, K. Z., & Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer. https://doi.org/10.1007/978-3-662-53641-4_8
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1644 |
Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2015). Query-complexity amplification for random oracles (Vol. 9063, pp. 159–180). Presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland: Springer. https://doi.org/10.1007/978-3-319-17470-9_10
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1645
Gazi, P., & Tessaro, S. (2015). Secret-key cryptography from ideal primitives: A systematic verview. In 2015 IEEE Information Theory Workshop. Jerusalem, Israel: IEEE. https://doi.org/10.1109/ITW.2015.7133163
View
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1646 |
Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K. Z., & Stevens, S. (2015). Key-homomorphic constrained pseudorandom functions. In 12th Theory of Cryptography Conference (Vol. 9015, pp. 31–60). Warsaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-46497-7_2
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1647 |
Fuchsbauer, G., Hanser, C., & Slamanig, D. (2015). Practical round-optimal blind signatures in the standard model (Vol. 9216, pp. 233–253). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_12
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1648 |
Fuchsbauer, G., Jafargholi, Z., & Pietrzak, K. Z. (2015). A quasipolynomial reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer. https://doi.org/10.1007/978-3-662-47989-6_29
[Submitted Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1649 |
Benhamouda, F., Krenn, S., Lyubashevsky, V., & Pietrzak, K. Z. (2015). Efficient zero-knowledge proofs for commitments from learning with errors over rings. Presented at the ESORICS: European Symposium on Research in Computer Security, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-24174-6_16
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1650 |
Skórski, M., Golovnev, A., & Pietrzak, K. Z. (2015). Condensed unpredictability (Vol. 9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47672-7_85
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1651 |
Baldimtsi, F., Chase, M., Fuchsbauer, G., & Kohlweiss, M. (2015). Anonymous transferable e-cash. In Public-Key Cryptography - PKC 2015 (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer. https://doi.org/10.1007/978-3-662-46447-2_5
[Published Version]
View
| DOI
| Download Published Version (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1652 |
Alwen, J. F., & Serbinenko, V. (2015). High parallel complexity graphs and memory-hard functions. In Proceedings of the 47th annual ACM symposium on Theory of computing (pp. 595–603). Portland, OR, United States: ACM. https://doi.org/10.1145/2746539.2746622
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1654 |
Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). Generic security of NMAC and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48800-3_4
[Submitted Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1668 |
Gazi, P., Lee, J., Seurin, Y., Steinberger, J., & Tessaro, S. (2015). Relaxing full-codebook security: A refined analysis of key-length extension schemes. Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer. https://doi.org/10.1007/978-3-662-48116-5_16
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2015 |
Published |
Conference Paper |
IST-REx-ID: 1669 |
Pietrzak, K. Z., & Skórski, M. (2015). The chain rule for HILL pseudoentropy, revisited. Presented at the LATINCRYPT: Cryptology and Information Security in Latin America, Guadalajara, Mexico: Springer. https://doi.org/10.1007/978-3-319-22174-8_5
[Submitted Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1671 |
Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp. 368–387). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-47989-6_18
[Submitted Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1672 |
Alwen, J. F., Ostrovsky, R., Zhou, H., & Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In Advances in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_37
[Submitted Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1675
Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2015). Proofs of space. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_29
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1474 |
Ferrara, A., Fuchsbauer, G., Liu, B., & Warinschi, B. (2015). Policy privacy in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security Foundations, Verona, Italy: IEEE. https://doi.org/10.1109/CSF.2015.11
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)