Gilles Brassard, Claude Crepeau, Miklos Santha  Home/Search
Context Related
| iacr.org/1996/010.ps.gz 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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Assume A owns t secret k--bit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement One-out-of-t String Oblivious Transfer, denoted ( 2 . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 and t = 2 of two ... (Update)
Context of citations to this paper: More
.... transfer protocols have been investigated extensively and they all turn out to be information theoretically equivalent (See [6, 8, 12, 11, 9]) These reductions emphasize the importance of distributed oblivious transfer, since they enable other types of OT protocols to...
...that the binding condition fails. We will say that the reduction works for values and , I b (k; lim p(k; 0 We refer to [3] for a more sophisticated de nition of 1 2 OT; our protocols meet this de nition as well. The set of pairs for which a reduction works will be...
Cited by: More
Private Access to Distributed Information - Mann (1998) (Correct)
Private Simultaneous Messages Protocols with Applications - Ishai, Kushilevitz (1997) (Correct)
Computationally Secure Oblivious Transfer - Naor, Pinkas (1999) (Correct)
Similar documents (at the sentence level):
69.7%: Oblivious Transfers and Intersecting Codes - Brassard, Crepeau, Santha (1996) (Correct)
Active bibliography (related documents): More All
0.8: Oblivious Transfer with a Memory-Bounded Receiver - Cachin, Crepeau, Marcil (1998) (Correct)
0.6: Efficient Reduction among Oblivious Transfer Protocols .. - Crépeau.. (Correct)
0.4: Efficient Oblivious Transfer Schemes - Tzeng (2001) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Oblivious Transfers and Privacy Amplification - Brassard, Crépeau (1997) (Correct)
0.2: The Generation of Random Numbers that are Probably Prime - Beauchemin, BRASSARD.. (1988) (Correct)
0.2: Cryptology Column - 25 Years of Quantum Cryptography - Brassard, Crépeau (1996) (Correct)
Related documents from co-citation: More All
12: How to exchange secrets by oblivious transfer (context) - Rabin - 1981
9: Information Theoretic Reductions Among Disclosure Problems (context) - Brassard, Crepeau et al. - 1986
9: Founding cryptography on oblivious transfer (context) - Kilian - 1988
BibTeX entry: (Update)
G. Brassard, C. Crepeau, and M. Santha. Oblivious transfers and intersecting codes. In IEEE Transaction on Information Theory, special issue on coding and complexity. November 1996. http://citeseer.ist.psu.edu/brassard96oblivious.html More
@article{ brassard96oblivious,
author = "Brassard and Crepeau and Santha",
title = "Oblivious Transfers and Intersecting Codes",
journal = "IEEETIT: IEEE Transactions on Information Theory",
volume = "42",
year = "1996",
url = "citeseer.ist.psu.edu/brassard96oblivious.html" }
Citations (may not include all citations):860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1977
531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1989
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1983
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
140 How to play any mental game, or: A completeness theorem for .. (context) - Goldreich, Micali et al. - 1987
120 Secure computation (context) - Micali, Rogaway - 1992
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
98 Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1991
90 Secure multiparty protocols and zero-knowledge proof systems.. (context) - Beaver - 1991
88 Concatenated Codes (context) - Forney - 1966
84 Privacy amplification by public discussion (context) - Bennett, Brassard et al. - 1988
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990
55 Information theoretic reductions among disclosure problems (context) - Brassard, Cr'epeau et al. - 1986
30 How to solve any protocol problem---an efficiency improvemen.. - Goldreich, Vainish - 1988
24 Codes on algebraic curves (context) - Goppa - 1981
23 Controlled gradual disclosure schemes for random bits and th.. (context) - Cleve - 1990
23 Conjugate coding (context) - Wiesner
22 A general completeness theorem for two-party games (context) - Kilian - 1991
21 Personal communication (context) - Kilian
19 Generalized privacy amplification - Bennett, Brassard et al.
18 Modular curves and codes with a polynomial construction (context) - Katsman, Tsfasman et al. - 1984
18 Secret ballot elections in computer networks (context) - Nurmi, Salomaa et al. - 1991
18 Achieving oblivious transfer using weakened security assumpt.. (context) - Cr'epeau, Kilian - 1988
17 Minimum resource zero-knowledge proofs - Kilian, Micali et al. - 1989
14 Intersecting codes and independent families (context) - Cohen, Zemor - 1994
14 Equivalence between two flavours of oblivious transfers (abs.. - Cr'epeau - 1988
14 Committed oblivious transfer and private multi-party computa.. (context) - Cr'epeau, Graaf et al. - 1995
11 Linear codes and modular curves (context) - Manin, Vladut - 1984
10 Covering arrays and intersecting codes (context) - Sloane - 1993
10 Linear intersecting codes (context) - Cohen, Lempel - 1985
9 Oblivious transfers and privacy amplification - Brassard, Cr'epeau - 1996
7 A zero-knowledge poker protocol that achieves confidentialit.. - Cr'epeau - 1987
6 Comparing common secret information without leaking it (context) - Fagin, Naor et al. - 1994
5 Verifiable disclosure of secrets and applications (context) - Cr'epeau - 1990
5 Quantum oblivious transfer (context) - Cr'epeau - 1994
3 Intersecting goppa codes (context) - Retter - 1989
3 Zero-knowledge arguments and publickey cryptography (context) - De Santis, Di Crescenzo et al. - 1995
3 the reversibility of oblivious transfer (context) - Cr'epeau, S'antha - 1992
2 Minimal 2--coverings of finite affine spaces based on GF (2 (context) - Katona, Srivastava - 1983
1 Oblivious verification of common string (context) - Cr'epeau, Salvail - 1995
1 Correct and private reductions among oblivious transfers - Cr'epeau - 1990
1 Efficient reductions among oblivious transfer protocols base.. (context) - Cr'epeau, S'antha
1 Linear binary codes with intersecting properties (context) - Mikl'os - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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