Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
One-way function
OpenAlex ID:
C105355099
How to generate and exchange secrets
1986
·
Andrew Chi-Chih Yao
·
Annual Symposium on Foundations of Computer Science
·
4,685
How to construct random functions
1986
·
Oded Goldreich
, Shafi Goldwasser
, et al.
·
Journal of the ACM
·
2,387
PDF
Digitalized Signatures and Public-key Functions as Intractable as Factorization
1979
·
M. O. Rabin
·
DSpace@MIT (Massachusetts Institute of Technology)
·
1,406
PDF
Pseudo-random generation from one-way functions
1989
·
R. Impagliazzo
, L. A. Levin
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
909
PDF
Number-theoretic constructions of efficient pseudo-random functions
2004
·
Moni Naor
, Omer Reingold
·
Journal of the ACM
·
452
One-way functions are essential for complexity based cryptography
1989
·
R. Impagliazzo
, M. Luby
·
Annual Symposium on Foundations of Computer Science
·
437
FruitChains: A Fair Blockchain
2017
·
Rafael Pass
, Elaine Shi
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
404
Number-theoretic constructions of efficient pseudo-random functions
2002
·
M. Naor
, O. Reingold
·
Annual Symposium on Foundations of Computer Science
·
380
Fair Computation of General Functions in Presence of Immoral Majority
2007
·
Shafi Goldwasser
, Leonid Levin
·
Springer eBooks
·
363
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
2016
·
Shweta Agrawal
, Benoît Libert
, et al.
·
Lecture notes in computer science
·
347
How To Construct Random Functions
1984
·
O. Goldreich
, S. Goldwasser
, et al.
·
Annual Symposium on Foundations of Computer Science
·
307
One way functions and pseudorandom generators
1987
·
Leonid A. Levin
·
COMBINATORICA
·
282
Hiding instances in multioracle queries
1990
·
Donald Beaver
, Joan Feigenbaum
·
Lecture notes in computer science
·
278
Cryptography in $NC^0$
2006
·
Benny Applebaum
, Yuval Ishai
, et al.
·
SIAM Journal on Computing
·
270
Exposure-Resilient Functions and All-or-Nothing Transforms
2000
·
Ran Canetti
, Yevgeniy Dodis
, et al.
·
Lecture notes in computer science
·
223
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
2011
·
Daniele Micciancio
, Petros Mol
·
Lecture notes in computer science
·
219
On hiding information from an oracle
1989
·
Martín Abadi
, Joan Feigenbaum
, et al.
·
Journal of Computer and System Sciences
·
216
Public-Key Encryption Schemes with Auxiliary Inputs
2010
·
Yevgeniy Dodis
, Shafi Goldwasser
, et al.
·
Lecture notes in computer science
·
214
The Complexity of Online Memory Checking
2005
·
M. Naor
, G.N. Rothblum
·
Journal of the ACM
·
190
Privacy and communication complexity
1989
·
E. Kushilevitz
·
Annual Symposium on Foundations of Computer Science
·
188
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
1999
·
Moni Naor
, Omer Reingold
·
Journal of Computer and System Sciences
·
179
On Worst‐Case to Average‐Case Reductions for NP Problems
2004
·
A. Bogdanov
, L. Trevisan
·
SIAM Journal on Computing
·
175
Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods
2002
·
Tal Malkin
, Daniele Micciancio
, et al.
·
Lecture notes in computer science
·
173
Computationally Private Randomizing Polynomials and Their Applications
2006
·
Benny Applebaum
, Yuval Ishai
, et al.
·
Computational Complexity
·
159
PDF
How to Garble RAM Programs?
2013
·
Steve Lu
, Rafail Ostrovsky
·
Lecture notes in computer science
·
153
Show more works
View as search
Works count:
727
Citation count:
22,620
Year
Topic
Type