Securely combining public-key cryptosystems

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2001, Pages 215-224

  Haber, Stuart ^a   Pinkas, Benny ^a  

^a STAR Lab Intertrust Tech   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; SECURITY OF DATA;

RANDOM-ORACLE MODELS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0035750948     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501983.502013     Document Type: Conference Paper

References (23)

1. Relations among notions of security for public-key encryption schemes
2. Optimal asymmetric encryption
3. The exact security of digital signatures: How to sign with RSA and Rabin
4. New types of cryptanalytic attacks using related keys
5. Non-interactive zero-knowledge and its applications
6. Simplified OAEP for the RSA and rabin functions
7. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
8. Signature schemes based on the strong RSA assumption
9. Non malleable cryptography
10. An efficient existentially unforgeable signature scheme and its applications
11. A public key cryptosystem and a signature scheme based on discrete logarithms
12. RSA-OAEP is secure under the RSA assumption
13. Secure hash-and-sign signatures without the random oracle
14. Chameleon hash functions
15. Public-key cryptosystems provably secure against chosen ciphertext attacks
16. Security proofs for signature schemes
17. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack
18. Efficient signature generation by smart cards
19. Using hash functions as a hedge against chosen ciphertext attacks
20. OAEP reconsidered