Completely Non-malleable Encryption Revisited

DOI10.1007/978-3-540-78440-1_5MaRDI QIDQ5445447zbMATH OpenOpenAlexFDO

Authors Carmine Ventre, Ivan Visconti

Publication date 5 March 2008

Published in Public key cryptography -- PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9--12, 2008. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78440-1_5

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient completely non-malleable public key encryption
• Automata, Languages and Programming
• Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles
• Non-malleable encryption: simpler, shorter, stronger
• Lattice-based completely non-malleable public-key encryption in the standard model

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 2009957 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 1842496 (Why is no real title available?)
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• scientific article; zbMATH DE number 1418315 (Why is no real title available?)
• New and improved constructions of non-malleable cryptographic protocols

Cited in

(19)

• COA-secure obfuscation and applications
• Non-malleable encryption: simpler, shorter, stronger
• Lattice-based completely non-malleable public-key encryption in the standard model
• Non-malleable encryption: simpler, shorter, stronger
• Efficient completely non-malleable and RKA secure public key encryptions
• Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
• Encryption Simulatability Reconsidered
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles
• New and improved constructions of non-malleable cryptographic protocols
• Efficient completely non-malleable public key encryption
• Cascade Encryption Revisited
• Nonmalleable Cryptography
• scientific article; zbMATH DE number 1759790 (Why is no real title available?)
• Bit Encryption Is Complete
• Automata, Languages and Programming
• Fine-grained cryptography revisited
• Fine-grained cryptography revisited
• On the complete non-malleability of the Fujisaki-Okamoto transform

This page was built for publication: Completely Non-malleable Encryption Revisited

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