scholarly journals Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation

2017 ◽  
pp. 119-137 ◽  
Author(s):  
Alex Lombardi ◽  
Vinod Vaikuntanathan
Keyword(s):  
Pseudorandom Generators ◽  
Indistinguishability Obfuscation

scholarly journals On linear-size pseudorandom generators and hardcore functions

2014 ◽  
Vol 554 ◽  
pp. 50-63 ◽  
Author(s):  
Joshua Baron ◽  
Yuval Ishai ◽  
Rafail Ostrovsky
Keyword(s):  
Linear Size ◽  
Pseudorandom Generators ◽  
Hardcore Functions

Pseudorandom Generators for Combinatorial Shapes

2013 ◽  
Vol 42 (3) ◽  
pp. 1051-1076 ◽  
Author(s):  
Parikshit Gopalan ◽  
Raghu Meka ◽  
Omer Reingold ◽  
David Zuckerman
Keyword(s):  
Pseudorandom Generators

scholarly journals A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators

2015 ◽  
Vol 26 (02) ◽  
pp. 169-194 ◽  
Author(s):  
Koji Nuida ◽  
Takuro Abe ◽  
Shizuo Kaji ◽  
Toshiaki Maeno ◽  
Yasuhide Numata
Keyword(s):  
Mathematical Problem ◽  
Security Analysis ◽  
Hash Functions ◽  
Future Research ◽  
Theoretical Frameworks ◽  
Pseudorandom Generators ◽  
Mathematical Problems ◽  
Security Evaluations ◽  
Security Property ◽  
Provably Secure

In this paper, we specify a class of mathematical problems, which we refer to as “Function Density Problems” (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introduced by Dubrov and Ishai (STOC 2006). Our argument aims at proposing new theoretical frameworks for these topics (especially for the former) based on FDPs, rather than providing some concrete and practical results on the topics. We also give some examples of mathematical discussions on FDPs, which would be of independent interest from mathematical viewpoints. Finally, we discuss possible directions of future research on other crypto-graphic applications of FDPs and on mathematical studies on FDPs themselves.

scholarly journals Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions

2013 ◽  
Vol 42 (3) ◽  
pp. 1405-1430 ◽  
Author(s):  
Iftach Haitner ◽  
Omer Reingold ◽  
Salil Vadhan
Keyword(s):  
Pseudorandom Generators

Pseudorandom Generators for Read-Once ACC^0

2012 ◽  
Author(s):  
Dmitry Gavinsky ◽  
Shachar Lovett ◽  
Srikanth Srinivasan
Keyword(s):  
Pseudorandom Generators
Sign in / Sign up

Export Citation Format

Share Document