Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel  Home/Search
Context Related
| wisdom.weizmann.ac.i...bsottccproc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.il/~harnik/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a constant round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string is initially transmitted and each of the parties interacts based on a small portion of R. (Update)
Cited by: More
Information-Theoretic Conditions for - Two-Party Secure Function (2006) (Correct)
Oblivious Transfer and Balanced Functions - Damgård, Fehr, Salvail.. (2005) (Correct)
Cryptography in the Bounded Quantum-Storage Model - Damgård, Fehr.. (2005) (Correct)
Active bibliography (related documents): More All
2.8: Constant-Round Oblivious Transfer in the Bounded Storage.. - Ding, Harnik, Rosen.. (2004) (Correct)
0.9: On Constructing Locally Computable Extractors and Cryptosystems.. - Vadhan (2002) (Correct)
0.8: Optimal Randomizer Efficiency in the Bounded-Storage Model - Dziembowski, Maurer (Correct)
Similar documents based on text: More All
0.3: Non-Interactive Timestamping in the Bounded Storage Model - Moran, Shaltiel, Ta-Shma (2004) (Correct)
0.2: The Round-Complexity of Black-Box Concurrent Zero-Knowledge - Rosen (2003) (Correct)
0.2: Completeness in Two-Party Secure Computation Revisited - Harnik, Naor, Reingold, Rosen (Correct)
Related documents from co-citation: More All
3: Oblivious Transfer with a Memory Bounded Receiver - Cachin, Crepeau et al. - 1998
2: A randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
2: Unconditionally Secure Quantum Bit Commitment is Impossible (context) - Dominic - 1997
BibTeX entry: (Update)
Yan Zong Ding, Danny Harnik, Alon Rosen, and Ronen Shaltiel. Constant-round oblivious transfer in the bounded storage model. In Theory of Cryptography --- TCC '04, volume 2951, Cambridge, MA, USA, February 2004. Springer-Verlag. To appear. http://citeseer.ist.psu.edu/ding04constantround.html More
@misc{ ding04constantround,
author = "Y. Ding and D. Harnik and A. Rosen and R. Shaltiel",
title = "Constant-round oblivious transfer in the bounded storage model",
text = "Yan Zong Ding, Danny Harnik, Alon Rosen, and Ronen Shaltiel. Constant-round
oblivious transfer in the bounded storage model. In Theory of Cryptography
--- TCC '04, volume 2951, Cambridge, MA, USA, February 2004. Springer-Verlag.
To appear.",
year = "2004",
url = "citeseer.ist.psu.edu/ding04constantround.html" }
Citations (may not include all citations):208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1985
185 How to generate and exchange secrets (context) - Yao - 1986
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
98 How to play any mental game - a completeness theorem for pro.. (context) - Goldreich, Micali et al. - 1987
95 Limits on the provable consequences of oneway permutations - Impagliazzo, Rudich - 1989
77 the construction of pseudorandom permutations: Luby-racko# r.. - Naor, Reingold - 1999
75 Randomness is linear in space - Nisan, Zuckerman - 1996
63 How to construct constant-round zeroknowledge proof systems .. - Goldreich, Kahan - 1996
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1989
31 Extracting randomness: How and why (context) - Nisan - 1996
31 IEEE Transaction on Information Theory (context) - Cover, encoding - 1973
30 the existence of statistically hiding bit commitment schemes.. - Damgard, Pedersen et al. - 1993
25 Perfect zeroknowledge arguments for np using any one-way per.. - Naor, Ostrovsky et al. - 1998
24 Conditionally-perfect secrecy and a provably-secure randomiz.. - Maurer - 1992
24 Foundations of cryptography - volume (context) - Goldreich - 2003
22 Honest-verifier statistical zeroknowledge equals general sta.. - Goldreich, Sahai et al. - 1998
21 cient oblivious transfer protocols (context) - Naor, Pinkas - 2001
19 Error reduction for extractor - Raz, Reingold et al. - 1999
18 Extracting randomness via repeated condensing - Reingold, Shaltiel et al. - 2000
18 Achieving oblivious transfer using weakened security assumpt.. (context) - Crepeau, Kilian - 1988
17 The relationship between public key encryption and oblivious.. (context) - Gertner, Kannan et al. - 2000
15 Interactive hashing can simplify zero-knowledge protocol des.. (context) - Damgard - 1993
14 Everlasting security in the bounded storage model (context) - Aumann, Ding et al. - 2002
14 A sample of samplers - a computational perspective on sampli.. - Goldreich - 1997
14 Equivalence between two flavours of oblivious transfers - Crepeau - 1987
11 Secret key agreement by public discussion (context) - Maurer - 1993
10 Recent developments in explicit constructions of extractors (context) - Shaltiel - 2002
10 Practical quantum oblivious transfer protocols (context) - Bennett, Brassard et al. - 1992
9 Tight security proofs for the boundedstorage model - Dziembowski, Maurer - 2002
9 cient oblivious sampling (context) - Bellare, Rompel - 1994
8 Oblivious transfer in the bounded storage model (context) - Ding - 2001
8 Information theoretically secure communication in the limite.. (context) - Aumann, Rabin - 1999
8 Hyper-encryption and everlasting security (context) - Ding, Rabin - 2002
7 On constructing locally computable extractors and cryptosyst.. - Vadhan - 2003
6 Hyper-encryption against space-bounded adversaries from on-l.. - Lu - 2002
4 Honest verifier vs dishonest verifier in public cain zero-kn.. - Damgard, Goldreich et al. - 1995
3 wise independent random permutation of the cube (context) - Gowers, m- - 1996
3 Oblivious transfer with a memorybound receiver (context) - Cachin, Crepeau et al. - 1998
2 Unconditional security against memory-bound adversaries (context) - Cachin, Maurer - 1997
1 cient oblivious transfer in the bounded-storage model (context) - Hong, Chang et al. - 2002
1 Information theory versus complexity theory: Another test ca.. (context) - Damgard, Goldreich et al. - 1995
Documents on the same site (http://www.wisdom.weizmann.ac.il/~harnik/):
Monotone Complexity by Switching Lemma - Harnik, Raz (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC