Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
24
views
43
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,123
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — CRYPTO 2001
Oblivious Transfer in the Bounded Storage Model
other
Author(s):
Yan Zong Ding
Publication date
(Online):
August 2 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
Renewable Energy - Storage
Most cited references
43
Record
: found
Abstract
: not found
Conference Proceedings
: not found
How to generate and exchange secrets
Andrew Yao
(1986)
0
comments
Cited
307
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Peter W. Shor
(1997)
0
comments
Cited
289
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
How to play ANY mental game
O Goldreich
,
S Micali
,
A. Wigderson
(1987)
0
comments
Cited
136
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
August 2 2001
Pages
: 155-170
DOI:
10.1007/3-540-44647-8_9
SO-VID:
fa596d5f-1f5b-4334-ace1-921477768e00
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On the (Im)possibility of Obfuscating Programs
pp. 201
On the Unpredictability of Bits of the Elliptic Curve Diffie-Hellman Scheme
pp. 19
Universally Composable Commitments
pp. 41
Revocation and Tracing Schemes for Stateless Receivers
pp. 80
Minimal Complete Primitives for Secure Multi-party Computation
pp. 101
Robustness for Free in Unconditional Multi-party Computation
pp. 119
Secure Distributed Linear Algebra in a Constant Number of Rounds
pp. 137
Two-Party Generation of DSA Signatures
pp. 155
Oblivious Transfer in the Bounded Storage Model
pp. 171
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
pp. 190
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
pp. 213
Identity-Based Encryption from the Weil Pairing
pp. 230
A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0
pp. 239
OAEP Reconsidered
pp. 260
RSA-OAEP Is Secure under the RSA Assumption
pp. 275
Simplified OAEP for the RSA and Rabin Functions
pp. 292
Online Ciphers and the Hash-CBC Construction
pp. 310
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
pp. 332
Forward-Secure Signatures with Optimal Signing and Verifying
pp. 355
Improved Online/Offline Signature Schemes
pp. 368
An Efficient Scheme for Proving a Shuffle
pp. 388
An Identity Escrow Scheme with Appointed Verifiers
pp. 408
Session-Key Generation Using Human Passwords Only
pp. 440
Correlation Analysis of the Shrinking Generator
pp. 470
New Public Key Cryptosystem Using Finite Non Abelian Groups
pp. 524
Secure and Efficient Asynchronous Broadcast Protocols
pp. 542
Soundness in the Public-Key Model
pp. 566
Robust Non-interactive Zero Knowledge
Similar content
4,123
More efficient oblivious transfer and extensions for faster secure computation
Authors:
G Asharov
,
Y Lindell
,
T SCHNEIDER
…
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Authors:
Severin Winkler
,
Jürg Wullschleger
Spacetime-constrained oblivious transfer
Authors:
Damián Pitalúa-García
See all similar
Cited by
9
Constant-Round Oblivious Transfer in the Bounded Storage Model
Authors:
Yan Ding
,
Danny Harnik
,
Alon Rosen
…
Intrusion-Resilience Via the Bounded-Storage Model
Authors:
Stefan Dziembowski
Unconditional security from noisy quantum storage
Authors:
Stephanie Wehner
,
Robert Koenig
,
Juerg Wullschleger
See all cited by