Author:
Soni Pratik,Tessaro Stefano
Publisher
Springer International Publishing
Reference24 articles.
1. Lecture Notes in Computer Science;B Applebaum,2016
2. Barak, B., Mahmoody-Ghidary, M.: Lower bounds on signatures from symmetric primitives. In: 48th FOCS, pp. 680–688. IEEE Computer Society Press, October 2007
3. Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: the cascade construction and its concrete security. In: 37th FOCS, pp. 514–523. IEEE Computer Society Press, October 1996
4. Berman, I., Haitner, I.: From non-adaptive to adaptive pseudorandom functions. J. Cryptol. 28(2), 297–311 (2013). https://doi.org/10.1007/s00145-013-9169-2
5. Berman, I., Haitner, I., Komargodski, I., Naor, M.: Hardness-preserving reductions via cuckoo hashing. J. Cryptol. 32(2), 361–392 (2019). https://doi.org/10.1007/s00145-018-9293-0