122 search results - page 11 / 25 » Practical Threshold Signatures Without Random Oracles |
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
CCS
2010
ACM
14 years 2 months ago
2010
ACM
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
ASIACRYPT
2011
Springer
12 years 7 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 ...
PODC
2003
ACM
14 years 22 days ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
CISC
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...