New technique for chosen-ciphertext security based on non-interactive zero-knowledge

DOI10.1016/J.INS.2019.03.063MaRDI QIDQ2214958zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 10 December 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.03.063

zbMATH Keywords

random oracle modelchosen-ciphertext security

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 176565
• Tightly-secure key-encapsulation mechanism in the quantum random oracle model
• Constructing and understanding chosen ciphertext security via puncturable key encapsulation mechanisms
• Advances in Cryptology - EUROCRYPT 2004
• Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles

Cites work

• scientific article; zbMATH DE number 1583771 (Why is no real title available?)
• scientific article; zbMATH DE number 1617924 (Why is no real title available?)
• scientific article; zbMATH DE number 1618043 (Why is no real title available?)
• scientific article; zbMATH DE number 4057443 (Why is no real title available?)
• scientific article; zbMATH DE number 1341866 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
• Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient selective identity-based encryption without random oracles
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Generic Transforms to Acquire CCA-Security for Identity Based Encryption: The Cases of FOpkc and REACT
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Identity Based Encryption Without Redundancy
• Kurosawa-Desmedt meets tight security
• New directions in cryptography
• Nonmalleable Cryptography
• On the hardness of proving CCA-security of Signed ElGamal
• Practical Identity-Based Encryption Without Random Oracles
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Secure integration of asymmetric and symmetric encryption schemes
• Securing threshold cryptosystems against chosen ciphertext attack
• The Twin Diffie-Hellman Problem and Applications
• The \(k\)-BDH assumption family: bilinear map cryptography from progressively weaker assumptions
• Tightly CCA-secure encryption without pairings

Cited in

(2)

• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages

This page was built for publication: New technique for chosen-ciphertext security based on non-interactive zero-knowledge

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