Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
22
views
15
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,551
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — CRYPTO '98
From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs
other
Author(s):
Moni Naor
,
Omer Reingold
Publication date
(Online):
May 28 2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
AIP Publishing: Coronavirus
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
New hash functions and their use in authentication and set equality
Mark Wegman
,
J.Lawrence Carter
(1981)
0
comments
Cited
267
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Manuel R Blum
,
Silvio Micali
(1984)
0
comments
Cited
137
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Theory and application of trapdoor functions
Andrew Yao
(1982)
0
comments
Cited
121
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1998
Publication date (Online):
May 28 2006
Pages
: 267-282
DOI:
10.1007/BFb0055734
SO-VID:
24237f1f-15da-4421-a279-3e92c46296af
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1
pp. 13
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
pp. 212
Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree
pp. 26
Relations among notions of security for public-key encryption schemes
pp. 56
Differential collisions in SHA-0
pp. 89
A simplified approach to threshold and proactive RSA
pp. 121
Trading correctness for privacy in unconditional multi-party computation
pp. 137
Fast digital identity revocation
pp. 169
Identity escrow
pp. 223
Cryptanalysis of the Ajtai-Dwork cryptosystem
pp. 243
Cryptanalysis of the Chor-Rivest cryptosystem
pp. 257
Cryptanalysis of the oil and vinegar signature scheme
pp. 267
From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs
pp. 304
An efficient discrete log pseudo random generator
pp. 338
Quantum bit commitment from a physical assumption
pp. 354
On concrete security treatment of signatures derived from identification
pp. 408
On the existence of 3-round zero-knowledge protocols
pp. 424
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
pp. 442
Concurrent zero-knowledge: Reducing the need for timing constraints
pp. 486
Time-stamping with binary linking schemes
pp. 502
Threshold traitor tracing
Similar content
5,551
Spontaneous disentanglement of indistinguishable particles
Authors:
Eyal Buks
Corticosterone and prolactin responses to predictable and unpredictable novelty stress in rats
Authors:
H.Peter Pfister
,
Janice Muir
An implementation of the 802.1AE MAC Security Standard for in-car networks
Authors:
Berardino Carnevale
,
Francesco FALASCHI
,
Luca Crocetti
…
See all similar
Cited by
10
On Cryptographic Assumptions and Challenges
Authors:
Moni Naor
Distributed Pseudo-random Functions and KDCs
Authors:
Moni Naor
,
Benny Pinkas
,
Omer Reingold
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
Authors:
Virgil Gligor
,
Pompiliu Donescu
See all cited by