Sciweavers

EUROCRYPT
2008
Springer
13 years 6 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
EUROCRYPT
2008
Springer
13 years 6 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
EUROCRYPT
2008
Springer
13 years 6 months ago
Threshold RSA for Dynamic and Ad-Hoc Groups
Abstract--We consider the use of threshold signatures in adhoc and dynamic groups such as MANETs ("mobile ad-hoc networks"). We first show that known threshold RSA signat...
Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal R...
EUROCRYPT
2008
Springer
13 years 6 months ago
Protocols and Lower Bounds for Failure Localization in the Internet
Abstract. A secure failure-localization path-quality-monitoring (FLPQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even wh...
Boaz Barak, Sharon Goldberg, David Xiao
EUROCRYPT
2008
Springer
13 years 6 months ago
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio ...
EUROCRYPT
2008
Springer
13 years 6 months ago
Precise Concurrent Zero Knowledge
Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed t...
Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung D...
EUROCRYPT
2008
Springer
13 years 6 months ago
Zero-Knowledge Sets with Short Proofs
Dario Catalano, Dario Fiore, Mariagrazia Messina
EUROCRYPT
2008
Springer
13 years 6 months ago
Predicting Lattice Reduction
Nicolas Gama, Phong Q. Nguyen
EUROCRYPT
2008
Springer
13 years 6 months ago
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
Jens Groth, Yuval Ishai