A cryptographic primitive based on hidden-order groups

DOI10.1515/JMC.2009.005MaRDI QIDQ3182465zbMATH OpenFDO

Authors Amitabh Saxena, Ben Soh

Publication date 9 October 2009

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/JMC.2009.005

zbMATH Keywords

broadcast encryptiongroups with infeasible inversionmultiparty computationnon-interactive key agreement

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptographic primitives based on groups on hidden order
• scientific article; zbMATH DE number 1951620
• Diffie-Hellman Oracles
• A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
• scientific article; zbMATH DE number 1857540

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• An observation on associative one-way functions in complexity theory
• Constant-Round Authenticated Group Key Exchange for Dynamic Groups
• Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
• Identity-Based Encryption from the Weil Pairing
• On Pairing Inversion Problems
• Paillier's trapdoor function hides up to O(n) bits
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Public Traceability in Traitor Tracing Schemes
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Theory of Cryptography
• Zero-knowledge proofs of identity

Cited in

(3)

• On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
• Cryptographic primitives based on groups on hidden order
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

This page was built for publication: A cryptographic primitive based on hidden-order groups

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