Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.”10.1007/s00145-013-9148-7__Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.

Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:10.1007/978-3-662-44371-2_7.

Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.

Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.

Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33.

Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp. 115–29, doi:10.1109/CSF.2013.15.

Krenn, Stephan, et al. A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:10.1007/978-3-642-36594-2_2.

Blazy, Olivier, et al. “Short Blind Signatures.”10.3233/JCS-130477__Journal of Computer Security, vol. 21, no. 5, IOS Press, 2013, pp. 627–61, doi:10.3233/JCS-130477.

Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.

Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.”10.1007/978-3-642-33027-8_13__10.1007/978-3-642-33027-8_13__Conference Proceedings CHES 2012, vol. 7428, Springer, 2012, pp. 213–32, doi:10.1007/978-3-642-33027-8_13.

Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.”10.1007/978-3-642-34047-5_20__10.1007/978-3-642-34047-5_20__Conference Proceedings FSE 2012, vol. 7549, Springer, 2012, pp. 346–65, doi:10.1007/978-3-642-34047-5_20.

Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.”10.1145/2382196.2382249__Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.

Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.

Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise. Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9.

Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237, Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22.

Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp. 548–63, doi:10.1007/978-3-642-28914-9_31.

Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well. Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.

Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.