Jens Groth Rafail Ostrovsky + UCLA Computer Science Department 4732 Boelter...  Home/Search
Context
Related
| iacr.org/2006/407.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/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The common random string model permits the construction of cryptographic protocols that are provably impossible to realize in the standard model. In this model, a trusted party generates a random string and gives it to all parties in the protocol. However, the introduction of such a third party should set alarm bells going off: Who is this trusted party? Why should we trust that the string is random? Even if the string is uniformly random, how do we know it does not leak private information ... (Update)
Active bibliography (related documents): More All
0.6: Compact Group Signatures without Random Oracles - Boyen, Waters (2005) (Correct)
0.3: A Universally Composable Mix-Net - Wikström (2004) (Correct)
0.3: Universally Composable DKG with Linear Number of Exponentiations - Wikström (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ rafail-cryptography,
author = "Jens Groth Rafail",
title = "Cryptography in the Multi-string Model",
url = "citeseer.ist.psu.edu/761519.html" }
Citations (may not include all citations):189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2000
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
77 Non-interactive zero-knowledge and its applications (context) - Blum, Feldman et al. - 1988
70 Two theorems on random polynomial time (context) - Adleman - 1978
67 Definitions and properties of zero-knowledge proof systems - Goldreich, Oren - 1994
56 Universally composable commitments - Canetti, Fischlin - 2001
43 Universally composable twoparty and multi-party secure compu.. - Canetti, Lindell et al. - 2002
30 Short group signatures - Boneh, Boyen et al. - 2004
14 Strengthening zero-knowledge protocols using signatures - Garay, MacKenzie et al. - 2003
13 Perfect non-interactive zero-knowledge for np - Groth, Ostrovsky et al. - 2006
10 On simulation-sound trapdoor commitments - MacKenzie, Yang - 2003
9 Perfect hiding and perfect binding universally composable co.. - Damgard, Nielsen - 2002
8 Universally composable protocols with relaxed set-up assumpt.. (context) - Barak, Canetti et al. - 2004
3 Secure multi-party computation without agreement (context) - Goldwasser, Lindell - 2005
2 Non-interactive zaps and new techniques for nizk - Groth, Ostrovsky et al. - 2006
1 Simulation-sound nizk proofs for a practical language and co.. (context) - Groth - 2006
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (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