132 search results - page 8 / 27 » New and improved constructions of non-malleable cryptographi... |
CORR
2006
Springer
13 years 7 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....
ICITS
2009
13 years 5 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
IANDC
2008
13 years 8 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
IWSEC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Pairing-based cryptography (PBC) has enabled the construction of many cryptographic protocols. However, there are scenarios when PBC is too heavyweight to use, such as wh...
COCO
2007
Springer
14 years 2 months ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...