Yuval Ishai + Eyal Kushilevitz Rafail Ostrovsky Amit Sahai November 15,...  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/75.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: ucla.edu/~rafail/PUBLIC/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that one can leverage on anonymity in a variety of cryptographic contexts. Our results go in two directions. (Update)
Cited by: More
Cryptography from Anonymity - Yuval Ishai Eyal (Correct)
Searchable Symmetric Encryption: Improved.. - Curtmola, Garay.. (2006) (Correct)
Security Protocols with Isotropic Channels - Madhukar Anand Eric (Correct)
Active bibliography (related documents): More All
0.5: General Constructions for Information-Theoretic Private .. - Beimel, Ishai.. (2003) (Correct)
0.5: Invited Survey Paper - Directions In Polynomial (Correct)
0.4: On Security of Sublinear Oblivious Transfer - Laur, Lipmaa (2006) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
Related documents from co-citation: More All
2: Privacy amplification by public discussions (context) - Charles, Gilles et al. - 1988
2: IEEE Transactions on Information Theory (context) - Bennett, Brassard et al. - 1995
2: keyless cryptography (context) - Alpern, Schneider et al. - 1983
BibTeX entry: (Update)
@misc{ eyal-cryptography,
author = "Yuval Ishai Eyal",
title = "Cryptography from Anonymity",
url = "citeseer.ist.psu.edu/ishai06cryptography.html" }
Citations (may not include all citations):329 Untraceable Electronic Mail (context) - Chaum - 1981
179 Security and composition of multiparty cryptographic protoco.. - Canetti - 2000
174 Private information retrieval - Chor, Goldreich et al. - 1998
122 How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
114 Improved decoding of Reed-Solomon and algebraic-geometry cod.. - Guruswami, Sudan - 1999
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
98 Computationally private information retrieval with polylogar.. - Cachin, Micali et al.
84 Privacy Amplification by Public Discussion (context) - Bennett, Brassard et al. - 1988
81 Replication is not needed: single database (context) - Kushilevitz, Ostrovsky - 1997
75 Randomness is Linear in Space - Nisan, Zuckerman - 1996
68 Secret key agreement by public discussion from common inform.. - Maurer - 1993
66 A Zero-One Law for Boolean Privacy - Chor, Kushilevitz - 1991
53 A minimal model for secure computation - Feige, Kilian et al. - 1994
46 Efficient Cryptographic Schemes Provably as Secure as Subset.. - Impagliazzo, Naor - 1996
35 Secure Multiparty Computation of Approximations - Feigenbaum, Ishai et al. - 2001
32 Elections with Unconditionally-Secret Ballots and Disruption.. (context) - Chaum - 1988
29 Reducing the servers' computation in private information ret.. - Beimel, Ishai et al. - 2004
23 Secure Games with Polynomial Expressions - Kiayias, Yung - 2001
20 Networks without user observability -- design options (context) - Pfitzmann, Waidner - 1987
18 Barrier for InformationTheoretic Private Information Retriev.. (context) - Beimel, Ishai et al. - 2002
17 Noisy Polynomial Interpolation and Noisy Chinese Remainderin.. - Bleichenbacher, Nguyen - 2000
16 Foundations of Cryptography: Basic Applications (context) - Goldreich - 2004
14 From partial consistency to global broadcast - Fitzi, Maurer - 2000
11 Efficient Multiparty Computations Secure Against an Adaptive.. - Cramer, Damgard et al. - 1999
11 An Oblivious Transfer Protocol with Log-Squared Communicatio.. - Lipmaa - 2005
10 Cryptographic Hardness based on the Decoding of Reed-Solomon.. - Kiayias, Yung - 2002
10 Multiparty Secret Key Exchange Using a Random Deal of Cards - Fischer, Wright - 1991
9 Revealing information while preserving privacy (context) - Dinur, Nissim - 2003
8 Information-Theoretic Pseudosignatures and Byzantine Agreeme.. - Pfitzmann, Waidner
7 Perfect Constant-Round Secure Computation via Perfect Random.. - Ishai, Kushilevitz - 2002
6 Keyless Cryptography (context) - Alpern, Schneider et al. - 1983
6 Decoding of Interleaved Reed Solomon Codes over Noisy Data (context) - Bleichenbacher, Kiayias et al. - 2003
5 Provable Unlinkability against Traffic Analysis - Berman, Fiat et al. - 2004
5 Oblivious polynomial evaluation (context) - Naor, Pinkas - 2006
4 Toward Privacy in Public Databases (context) - Chawla, Dwork et al. - 2005
4 Minimal Complete Primitives for Secure Multi-party Computati.. - Fitzi, Garay et al. - 2001
4 dimensional space from noisy data (context) - Coppersmith, Sudan et al. - 2003
4 Single-Database Private Information Retrieval with Constant .. (context) - Gentry, Ramzan - 2005
4 Batch codes and their applications - Ishai, Kushilevitz et al. - 2004
3 Ostrovsky: Reducibility and Completeness in Private Computat.. (context) - Kilian, Kushilevitz et al. - 2000
3 A Quantitative Approach to Reductions in Secure Computation (context) - Beimel, Malkin - 2004
3 Completeness in two-party secure computation: a computationa.. - Harnik, Naor et al. - 2004
3 Personal communication (context) - Guruswami, Parvaresh
3 Cryptography from Anonymity - Ishai, Kushilevitz et al. - 2006
2 Correcting Errors Beyond the Guruswami-Sudan Radius in Polyn.. (context) - Parvaresh, Vardy - 2005
2 Basing cryptographic protocols on tamper-evident Seals - Moran, Naor - 2005
2 Explicit Capacity-Achieving List-Decodable Codes (context) - Guruswami, Rudra - 2006
2 and Multi-party Computation from Correlated Randomness (context) - Fitzi, Wolf et al. - 2004
http://www.freehaven.net/anonbib/
Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html): More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (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