Sciweavers

22 search results - page 3 / 5
» A Note on Universal Composable Zero Knowledge in Common Refe...
Sort
View
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
FOCS
2004
IEEE
14 years 8 days ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
FOCS
2007
IEEE
14 years 2 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
TCC
2010
Springer
133views Cryptology» more  TCC 2010»
13 years 6 months ago
On the Necessary and Sufficient Assumptions for UC Computation
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
CORR
2006
Springer
169views Education» more  CORR 2006»
13 years 8 months ago
Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
Yi Deng, Giovanni Di Crescenzo, Dongdai Lin