Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMATH Open1104.68045DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311532FDOQ5311532

Authors: Craig Gentry 

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99099

Recommendations

• Topics in Cryptology – CT-RSA 2004
• The exact security of digital signatures -- how to sign with RSA and Rabin
• Efficient Rabin-type digital signature scheme
• Optimal security proofs for full domain hash, revisited
• Proving Tight Security for Rabin-Williams Signatures

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (7)

• Effectiveness of multiple compressions of multiple signatures
• The geometry of provable security: some proofs of security in which lattices make a surprise appearance
• Batch verification of short signatures
• Compression-RSA technique: A more efficient encryption-decryption procedure
• Provably secure proxy signature scheme from factorization
• Topics in Cryptology – CT-RSA 2004
• Tag-KEM/DEM: A new framework for hybrid encryption

This page was built for publication: Advances in Cryptology – CRYPTO 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311532)