An improved threshold homomorphic cryptosystem based on class groups

DOI10.1007/978-3-031-71073-5_2MaRDI QIDQ6660542

Kelsey Melissaris, Ivan B. Damgård, Ida Tucker, Lennart Braun, Fabien Laguillaumie, Claudio Orlandi, Guilhem Castagnos

Publication date: 10 January 2025

zbMATH Keywords

zero-knowledge protocolscryptosystem based on class groups

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure distributed key generation for discrete-log based cryptosystems
• Practical fully secure unrestricted inner product functional encryption modulo \(p\)
• Efficient range proofs with transparent setup from bounded integer commitments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
• Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
• Secure multiparty computation from threshold encryption based on class groups
• On sigma-protocols and (packed) black-box secret sharing schemes

Related Items (1)

Efficient succinct zero-knowledge arguments in the CL framework

This page was built for publication: An improved threshold homomorphic cryptosystem based on class groups

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