How to Construct Pseudorandom Functions Extracts from Foundations of Cryptography1
نویسنده
چکیده
منابع مشابه
Constrained Pseudorandom Functions: Verifiable and Delegatable
Constrained pseudorandom functions (introduced independently by Boneh and Waters (CCS 2013), Boyle, Goldwasser, and Ivan (PKC 2014), and Kiayias, Papadopoulos, Triandopoulos, and Zacharias (CCS 2013)), are pseudorandom functions (PRFs) that allow the owner of the secret key k to compute a constrained key kf , such that anyone who possesses kf can compute the output of the PRF on any input x suc...
متن کاملPrivate Key Encryption Instructor : Rafael Pass Scribe : Ashwin Machanavajjhala
Till this point in the course we have learnt how to define secrecy and how to construct tools like one way functions, pseudorandom generators and pseudorandom functions. We will now use the concepts we learnt to construct a secure encryption scheme. In this class we propose a few intuitive definitions for the security of an encryption scheme, show their equivalence and then show a simple constr...
متن کاملTowards bridging theory and implementation of cryptographic primitives
It has been widely observed that there is a significant gap between the way that many cryptographic primitives are constructed and analyzed by the theory/foundations community, and the way that they are implemented, used, and attacked in practice. In this dissertation we study from two different perspectives the complexity of constructing cryptographic primitives, with an eye towards bridging t...
متن کاملHow to Construct Pseudorandom Permutations from Single Pseudorandom Functions
The paper examines permutation generators which are designed using four rounds of the Data Encryption Standard and a single pseudorandom function. We have proved that such generators are pseudorandom only if the pseudorandom function is used internally at least five times. The proof is given using two different approaches: deterministic and probabilistic. Some cryptographic implications are als...
متن کاملPseudorandom Functions: Three Decades Later
In 1984, Goldreich, Goldwasser and Micali formalized the concept of pseudorandom functions and proposed a construction based on any length-doubling pseudorandom generator. Since then, pseudorandom functions have turned out to be an extremely influential abstraction, with applications ranging from message authentication to barriers in proving computational complexity lower bounds. In this tutori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014