Article

Article title DESIGN OF ALGEBRAIC PSEUDORANDOM FUNCTIONS WITH IMPROVED EFFICIENCY
Authors I.A. Kalmikov, O.I. Dagaeva
Section SECTION IV. METHODS AND MEANS OF CRYPTOGRAPHY AND STEGANOGRAPHY
Month, Year 12, 2011 @en
Index UDC 681.3
DOI
Abstract There is considered issues related with constructing an algebraic pseudorandom function with improved efficiency. It is proved that the pseudorandom function can be based on a cascade construction. Our pseudorandom function is secure to attacking algorithms not less then counterparts and it uses shorter private keys.

Download PDF

Keywords Pseudorandom functions; parallel security; cascade construction; l-DDH assumption.
References 1. Goldreich Oded, Goldwasser Shafi, Micali Silvio. How to construct random functions // JACM. – 1986. – Vol. 33, № 4. http://www.wisdom.weizmann.ac.il/~oded/ggm.html.
2. Naor Moni, Reingold Omer. Number-theoretic constructions of efficient pseudo-random functions // In FOCS’97. – 1997. – P. 458-467. http://www.wisdom.weizmann.ac.il/~naor/PAPERS/gdh_abs.html.
3. Bellare Mihir, Canetti Ran, Krawczyk Hugo. Pseudorandom functions revisited: The cascade construction and its concrete security. In FOCS’96, 1996. http://cseweb.ucsd.edu/~mihir/ papers/ cascade.html.
4. Dan Boneh, Shai Halevi, Michael Hamburg, and Rafail Ostrovsky. Circular-secure encryption from decision Diffie-Hellman. In CRYPTO’08, 2008. – P. 108-125. http://crypto.stanford.edu/~dabo/abstracts/circular.html.
5. Boneh Dan, Montgomery Hart, Raghunathan Ananth. Algebraic pseudorandom functions with improved efficiency from the augmented cascade. In ACM Conference on Computer and Communications Security – CCS 2010 (to appear), 2010. http://crypto.stanford.edu/~dabo/pubs/ abstracts/algebprf.html.

Comments are closed.