Gilles Brassard, Claude Crépeau  Home/Search
Context Related
| cs.mcgill.ca/pub/theorique/pa...BC97.ps cs.mcgill.ca/pub/theorique...BC97.ps.gz cs.mcgill.ca/~crepeau/GZIP...BC97.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: cs.mcgill.ca/~crepe...proceedings (more) From: counterpane.com/biblio...authorB (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Assume A owns two 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 string. 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-two String Oblivious Transfer, denoted ( 2 1 )--OT k . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 of two... (Update)
Context of citations to this paper: More
...problems except the one in [4] which is based on hardness of computing discrete logarithm. The reduction approach is studied in [8, 9, 11, 15, 26]. For example, a k bit string OT 1 2 scheme can be achieved by invoking #k runs of a bit OT 1 2 scheme for some #, 2 # # # 18,...
Cited by: More
Information-Theoretic Conditions for - Two-Party Secure Function (2006) (Correct)
Oblivious Transfers and Intersecting Codes - Brassard, Crepeau, Santha (1996) (Correct)
Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997) (Correct)
Similar documents (at the sentence level):
69.0%: Oblivious Transfers and Privacy Amplification - Crepeau (1996) (Correct)
Active bibliography (related documents): More All
0.5: Quantum Oblivious Transfer - Crépeau (1994) (Correct)
0.2: On the Reversibility of Oblivious Transfer - Claude Cr'epeau (Correct)
0.2: Cryptographic Primitives and Quantum Theory - Crépeau (1993) (Correct)
Similar documents based on text: More All
0.6: Generalized Zig-zag Functions and Oblivious Transfer Reductions - Arco, Stinson (2001) (Correct)
0.4: Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000) (Correct)
0.3: An Exact Quantum Polynomial-Time Algorithm for Simon's Problem - Brassard, Høyer (1997) (Correct)
Related documents from co-citation: More All
6: Founding cryptography on oblivious transfer (context) - Kilian - 1988
6: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
6: How to exchange secrets by oblivious transfer (context) - Rabin - 1981
BibTeX entry: (Update)
BRASSARD, G. AND C. CR EPEAU, "Oblivious transfers and privacy amplification", In Proc. EUROCRYPT 97 (1997), Springer-Verlag, pp. 334--347, Lecture Notes in Computer Science No. 1233. http://citeseer.ist.psu.edu/article/brassard97oblivious.html More
@article{ brassard97oblivious,
author = "Gilles Brassard and Claude Cr{\'e}peau",
title = "Oblivious Transfers and Privacy Amplification",
journal = "Lecture Notes in Computer Science",
volume = "1233",
pages = "334--??",
year = "1997",
url = "citeseer.ist.psu.edu/article/brassard97oblivious.html" }
Citations (may not include all citations):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
191 New hash functions and their use in authentication and set e.. (context) - Carter, Wegman - 1981
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
84 Privacy amplification by public discussion (context) - Bennett, Brassard et al. - 1988
55 Information theoretic reductions among disclosure problems (context) - Brassard, Cr'epeau et al. - 1986
49 All-or-nothing disclosure of secrets - Brassard, Cr'epeau et al. - 1987
32 Probability Theory (context) - R'enyi - 1970
18 Committed oblivious transfer and private multi-party computa.. (context) - Cr'epeau, Graaf et al. - 1995
15 Oblivious transfers and intersecting codes - Brassard, Cr'epeau et al. - 1996
14 Intersecting codes and independent families (context) - Cohen, Z'emor - 1994
13 Correct and Private Reductions Among Oblivious Transfers (context) - Cr'epeau - 1990
10 Linear intersecting codes (context) - Cohen, Lempel - 1985
8 Verifiable disclosure of secrets and application (context) - Cr'epeau - 1990
8 Smooth entropy and R'enyi entropy - Cachin - 1997
6 Efficient reductions among oblivious transfer protocols base.. (context) - Cr'epeau, S'antha - 1991
4 the reversibility of oblivious transfer (context) - Cr'epeau, S'antha - 1991
1 Private communication (context) - Stinson - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.mcgill.ca/~crepeau/proceedings.html): More
A zero-knowledge Poker protocol that achieves confidentiality of.. - Crépeau (1986) (Correct)
Weakening Security Assumptions and Oblivious Transfer - Crépeau, al. (Correct)
Computationally convincing proofs of knowledge.. - Brassard, Crépeau.. (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