24 search results - page 3 / 5 » A New Sampling Protocol and Applications to Basing Cryptogra... |
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
ASIACRYPT
2009
Springer
14 years 26 days ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
PKC
2011
Springer
12 years 9 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
CANS
2006
Springer
13 years 10 months ago
2006
Springer
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
POPL
2001
ACM
14 years 6 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...