113 search results - page 15 / 23 » Provable Security of ID-Based Proxy Signature Schemes |
CRYPTO
2004
Springer
14 years 3 days ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
ASIACRYPT
2000
Springer
13 years 11 months ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
ICISC
2004
13 years 8 months ago
2004
In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n - t entities to generate a publicly verifiable t-out-of-n signature on behalf of ...
JOC
2006
13 years 6 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...