搜索结果: 1-11 共查到“密码学 Pseudorandom Generators”相关记录11条 . 查询时间(0.062 秒)
Designated-verifier pseudorandom generators, and their applications
non-interactive zero-knowledge computational Diffie-Hellman learning with errors
2019/3/4
We provide a generic construction of non-interactive zero-knowledge (NIZK) schemes. Our construction is a refinement of Dwork and Naor’s (FOCS 2000) implementation of the hidden bits model using verif...
Keeping or Losing Tiny-Error Correctness of Cryptosystems Implemented by Secure Pseudorandom Generators
foundations implementation pseudo-randomness
2018/8/2
Randomness is essential but expensive resource for cryptography, and secure (and efficient) implementations of randomness using pseudorandom generators (PRGs) are much concerned in this area. On the o...
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)
pseudorandom generators local computation obfuscation
2017/4/12
As a corollary, we refute some conjectures recently made in the cryptographic literature. This includes refuting the assumptions underlying Lin and Tessaro's recently proposed candidate construction f...
A Formal Treatment of Backdoored Pseudorandom Generators
pseudorandomness subversion pseudorandom generator
2016/3/21
We provide a formal treatment of backdoored pseudorandom generators (PRGs). Here a saboteur chooses a PRG instance for which she knows a trapdoor that allows prediction of future (and possibly past) g...
Let $G:\bits^n\to\bits^m$ be a pseudorandom generator. We say that a circuit implementation of $G$ is {\em $(k,q)$-robust} if for every set $S$ of at most $k$ wires anywhere in the circuit, there is a...
Pseudorandom Generators from Regular One-way Functions: New Constructions with Improved Parameters
one-way functions pseudorandom generators
2014/3/13
We revisit the problem of basing pseudorandom generators on regular one-way functions, and present the following constructions:
(1) For any known-regular one-way function (on $n$-bit inputs) that is ...
A NOTE ON A YAO'S THEOREM ABOUT PSEUDORANDOM GENERATORS
pseudorandom generator asymptotic point algorithms
2009/11/18
The Yao's theorem gives an equivalence between the
indistinguishability of a pseudorandom generator and the impre-
dictability of the next bit from an asymptotic point of view. We
present in this p...
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
Saving Private Randomness One-Way Functions Pseudorandom Generators
2009/6/2
Can a one-way function f on n input bits be used with fewer than n bits while retaining comparable
hardness of inversion? We show that the answer to this fundamental question is negative, if one is l...
On Constructing Parallel Pseudorandom Generators from One-Way Functions
Pseudorandom generator construction one-way function black-box
2009/2/9
We study pseudorandom generator (PRG) constructions Gf : f0; 1gl ! f0; 1gl+s
from one-way functions f : f0; 1gn ! f0; 1gm. We consider PRG constructions of
the form Gf (x) = C(f(q1) : : : f(qpoly(n)...
Efficient Pseudorandom Generators Based on the DDH Assumption
Pseudorandom Generators DDH Assumption
2008/12/18
A family of pseudorandom generators based on the decisional Diffie-
Hellman assumption is proposed. The new construction is a modified and generalized
version of the Dual Elliptic Curve generator pr...
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
Saving Private Randomness One-Way Functions and Pseudorandom Generators
2008/5/21
Can a one-way function f on n input bits be used with fewer than n bits while retaining comparable
hardness of inversion? We show that the answer to this fundamental question is negative, if one is l...