A cryptographic primitive based on hidden-order groups
From MaRDI portal
Publication:3182465
DOI10.1515/JMC.2009.005zbMath1171.94360MaRDI QIDQ3182465
Publication date: 9 October 2009
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
broadcast encryptionmultiparty computationgroups with infeasible inversionnon-interactive key agreement
Cites Work
- An observation on associative one-way functions in complexity theory
- Zero-knowledge proofs of identity
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
- Paillier's trapdoor function hides up to \(O(n)\) bits
- A method for obtaining digital signatures and public-key cryptosystems
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Identity-Based Encryption from the Weil Pairing
- Public Traceability in Traitor Tracing Schemes
- On Pairing Inversion Problems
- Constant-Round Authenticated Group Key Exchange for Dynamic Groups
- Theory of Cryptography
This page was built for publication: A cryptographic primitive based on hidden-order groups
