pseudorandom functions
Multilinear Pseudorandom Functions
... Pseudorandom functions (PRFs) are of fundamental importance in modern cryp- ...random functions are too unstruc- tured for many applications, and as a result many specialized pseudorandom ...
14
Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
... secure pseudorandom functions from non-adaptive pseudorandom functions [19, 22, 23, 8, 2, 4] is a very important problem that has received plenty of ...
12
Bootstrapping Obfuscators via Fast Pseudorandom Functions
... We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom ...
9
Efficient Pseudorandom Functions via On-the-Fly Adaptation
... Abstract. Pseudorandom functions (PRFs) are one of the most fundamental building blocks in cryp- tography with numerous applications such as message authentication codes and private key ...`-bounded ...
19
Quantum-secure message authentication via blind-unforgeability
... We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. This notion defines a function to be predictable if there exists an adversary who can use “partially blinded” ...
38
Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
... Pseudorandom functions (PRFs) are one of the fundamental building blocks in modern cryptogra- ...constrained pseudorandom functions 1 was proposed in the con- current works of Boneh and Waters ...
34
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
... Pseudorandom functions (PRFs), originally defined by Goldreich, Goldwasser, and Micali [GGM86], are one of the most fundamental primitives in ...be pseudorandom if its outputs are indistinguishable ...
43
Foundations of Cryptography Vol 1, Basic Tools pdf
... for pseudorandom functions (using any pseudorandom generator as a building ...block). Pseudorandom functions will be instrumental for some constructions to be presented in Chapters 5 ...
393
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
... of pseudorandom functions, several extensions have been proposed in the literature over the years, with the goal of providing additional functionalities to these ...the pseudorandom function for ...
29
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
... (RKD) functions which the adversary is re- stricted to using when modifying ...RKA-secure pseudorandom functions ...RKD functions that contain ...RKD functions under the DDH assumption, ...
40
Key-Homomorphic Constrained Pseudorandom Functions
... Pseudorandom functions (PRFs), like the AES block cipher, are the workhorses of cryptography. They allow for efficient and elegant solutions to all the basic symmetric- key cryptographic tasks, including ...
30
Related-Key Secure Pseudorandom Functions: The Case of Additive Attacks
... by pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) ...(RKD) functions Φ which specify the key-relations available to the adversary, and considered an active (and adaptive) ...
28
On the Correlation Intractability of Obfuscated Pseudorandom Functions
... hash functions is called “correlation intractable” if it is hard to find, given a random function in the family, an input-output pair that satisfies any “sparse” relation, namely any relation that is hard to ...
27
The Randomized Iterate Revisited - Almost Linear Seed Length PRGs from A Broader Class of One-way Functions
... that pseudorandom generators can be constructed almost optimally from known(-almost)-regular one-way functions, ...one-way functions (and at the same time improving the efficiency of the resulting ...
24
Monotone Circuits: One-Way Functions versus Pseudorandom Generators
... In this section, we prove Theorem 1.1. We focus on proving that the existence of OWFs implies the existence of weak-OWFs that are computable by small (uniform) monotone circuits. We derive standard OWFs (so computable) ...
8
XLS is not a Strong Pseudorandom Permutation
... Abstract. In FSE 2007, Ristenpart and Rogaway had described a generic method XLS to construct a length-preserving strong pseudorandom per- mutation (SPRP) over bit-strings of size at least n. It requires a length- ...
13
Adaptive Approaches of Built-In-Self-Test for Low Power Integrated Circuits
... signal-based pseudorandom test pattern generation and LP deterministic BIST and ...weighted pseudorandom pattern generation and 2) LP deterministic BIST with reseed- ...
12
Pseudorandom Quantum States
... a pseudorandom distribution on strings, since one can freely produce many copies of the input ...general. Pseudorandom states in terms of single-copy indistinguisha- bility have been discussed in the ...
27
Analysis of Cryptography and Pseudorandom Numbers
... case pseudorandom numbers are used for secure communication which can be used in many forms like in generating encryption keys, nonce, ...generated pseudorandom numbers can be applied in cryptographic ...
5
Robust Pseudorandom Generators
... We formalize the above question via the notion of robust pseudorandom generators. We say that a circuit implementation of G is (k, q)-robust if for every set S of at most k wires anywhere in the circuit there is a ...
31