Sciweavers

24 search results - page 1 / 5
» Short Signatures from Weaker Assumptions
Sort
View
ASIACRYPT
2011
Springer
12 years 4 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
IEICET
2010
105views more  IEICET 2010»
13 years 3 months ago
Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption
In this paper, we introduce the intermediate hashed Diffie-Hellman (IHDH) assumption which is weaker than the hashed DH (HDH) assumption (and thus the decisional DH assumption), a...
Goichiro Hanaoka, Kaoru Kurosawa
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
ASIACRYPT
2001
Springer
13 years 8 months ago
Short Signatures from the Weil Pairing
Abstract. We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the...
Dan Boneh, Ben Lynn, Hovav Shacham
IJNSEC
2011
108views more  IJNSEC 2011»
12 years 11 months ago
Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
Mingwu Zhang, Bo Yang, Yusheng Zhong, Pengcheng Li...