Two is better than one: How to securely combine two assumptions

DOI10.1080/09720529.2017.1367471zbMath1487.94106OpenAlexW2790039989MaRDI QIDQ5069998

Yonghong Chen, Ren Guo, Xiaogang Cheng

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2017.1367471

zbMATH Keywords

discrete logarithmsubset sumsecurity amplificationmathematical assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• The Security of Multiple Encryption in the Ideal Cipher Model
• From Multiple Encryption to Knapsacks – Efficient Dissection of Composite Problems
• Batch Range Proof for Practical Small Ranges
• Security Amplification for Interactive Cryptographic Primitives
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Identity-Based Encryption from the Weil Pairing
• Amplification of Chosen-Ciphertext Security
• Lattice-Based Group Signature Scheme with Verifier-Local Revocation
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Two is better than one: How to securely combine two assumptions