Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,”https://doi.org/10.1007/978-3-319-44618-9_21__9841:391–408. Springer, 2016.https://doi.org/10.1007/978-3-319-44618-9_21 .

Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs. “New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,”https://doi.org/10.1007/978-3-662-48797-6_6__9452:121–45. Springer, 2016.https://doi.org/10.1007/978-3-662-48797-6_6 .

Krenn, Stephan, Krzysztof Z Pietrzak, Akshay Wadia, and Daniel Wichs. “A Counterexample to the Chain Rule for Conditional HILL Entropy.”https://doi.org/10.1007/s00037-015-0120-9__Computational Complexity. Springer, 2016.https://doi.org/10.1007/s00037-015-0120-9 .

Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Offline Witness Encryption,”https://doi.org/10.1007/978-3-319-39555-5_16__9696:285–303. Springer, 2016.https://doi.org/10.1007/978-3-319-39555-5_16 .

Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Constrained PRFs for Unbounded Inputs,”https://doi.org/10.1007/978-3-319-29485-8_24__9610:413–28. Springer, 2016.https://doi.org/10.1007/978-3-319-29485-8_24 .

Abusalah, Hamza M, and Georg Fuchsbauer. “Constrained PRFs for Unbounded Inputs with Short Keys,”https://doi.org/10.1007/978-3-319-39555-5_24__9696:445–63. Springer, 2016.https://doi.org/10.1007/978-3-319-39555-5_24 .

Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy Privacy in Cryptographic Access Control,”https://doi.org/10.1109/CSF.2015.11__46–60. IEEE, 2015.https://doi.org/10.1109/CSF.2015.11 .

Banerjee, Abishek, Georg Fuchsbauer, Chris Peikert, Krzysztof Z Pietrzak, and Sophie Stevens. “Key-Homomorphic Constrained Pseudorandom Functions.”https://doi.org/10.1007/978-3-662-46497-7_2__In 12th Theory of Cryptography Conference, 9015:31–60. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-46497-7_2 .

Fuchsbauer, Georg, Zahra Jafargholi, and Krzysztof Z Pietrzak. “A Quasipolynomial Reduction for Generalized Selective Decryption on Trees,”https://doi.org/10.1007/978-3-662-47989-6_29__9215:601–20. Springer, 2015.https://doi.org/10.1007/978-3-662-47989-6_29 .

Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings.”https://doi.org/10.1007/978-3-319-24174-6_16__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-24174-6_16 .

Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Query-Complexity Amplification for Random Oracles,”https://doi.org/10.1007/978-3-319-17470-9_10__9063:159–80. Springer, 2015.https://doi.org/10.1007/978-3-319-17470-9_10 .

Fuchsbauer, Georg, Christian Hanser, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model,”https://doi.org/10.1007/978-3-662-48000-7_12__9216:233–53. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_12 .

Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.”https://doi.org/10.1109/ITW.2015.7133163__In 2015 IEEE Information Theory Workshop. IEEE, 2015.https://doi.org/10.1109/ITW.2015.7133163 .

Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security of NMAC and HMAC with Input Whitening.”https://doi.org/10.1007/978-3-662-48800-3_4__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-48800-3_4 .

Skórski, Maciej, Alexander Golovnev, and Krzysztof Z Pietrzak. “Condensed Unpredictability ,”https://doi.org/10.1007/978-3-662-47672-7_85__9134:1046–57. Springer, 2015.https://doi.org/10.1007/978-3-662-47672-7_85 .

Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss. “Anonymous Transferable E-Cash.”https://doi.org/10.1007/978-3-662-46447-2_5__In Public-Key Cryptography - PKC 2015, 9020:101–24. Springer, 2015.https://doi.org/10.1007/978-3-662-46447-2_5 .

Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.”https://doi.org/10.1145/2746539.2746622__In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, 595–603. ACM, 2015.https://doi.org/10.1145/2746539.2746622 .

Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.”https://doi.org/10.1007/978-3-662-48000-7_37__In Advances in Cryptology - CRYPTO 2015, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_37 .

Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy, Revisited.”https://doi.org/10.1007/978-3-319-22174-8_5__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-22174-8_5 .

Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC,”https://doi.org/10.1007/978-3-662-47989-6_18__9215:368–87. Springer, 2015.https://doi.org/10.1007/978-3-662-47989-6_18 .