122 search results - page 11 / 25 » Practical Threshold Signatures Without Random Oracles |
133
Voted
CRYPTO
2009
Springer
15 years 9 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...
108
click to vote
CCS
2010
ACM
15 years 10 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...
173
click to vote
ASIACRYPT
2011
Springer
14 years 3 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 ...
127
click to vote
PODC
2003
ACM
15 years 8 months 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...
178
click to vote
CISC
2009
Springer
15 years 1 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...