Easy verifiable primitives and practical public key cryptosystems

DOI10.1007/10958513_6MaRDI QIDQ3404394zbMATH OpenOpenAlexFDO

Authors David Galindo, Sebastià Martín, Paz Morillo, J. Villar

Publication date 9 February 2010

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1950624
• OAEP reconsidered
• A modular analysis of the Fujisaki-Okamoto transformation
• scientific article; zbMATH DE number 1842495
• Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes

Cited in

(5)

• scientific article; zbMATH DE number 1950624 (Why is no real title available?)
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• Tightly secure ring-LWE based key encapsulation with short ciphertexts
• Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

This page was built for publication: Easy verifiable primitives and practical public key cryptosystems

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