Sciweavers

876 search results - page 9 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
EUROCRYPT
2012
Springer
12 years 24 days ago
Lattice Signatures without Trapdoors
We provide an alternative method for constructing lattice-based digital signatures which does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan (ST...
Vadim Lyubashevsky
ACNS
2006
Springer
112views Cryptology» more  ACNS 2006»
14 years 4 months ago
Password Based Server Aided Key Exchange
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...
Yvonne Cliff, Yiu Shing Terry Tin, Colin Boyd
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 6 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
FSTTCS
2004
Springer
14 years 3 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
ASIACRYPT
2000
Springer
14 years 2 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson