25 search results - page 4 / 5 » Strongly Unforgeable ID-Based Signatures without Random Orac... |
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
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 ...
IJNSEC
2008
13 years 5 months ago
2008
The notion of strong designated verifier signature was put forth by Jakobsson, Sako and Impagliazzo in 1996, but the formal definition was defined recently by Saeednia, Kremer and...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
IACR
2011
12 years 5 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...