An improved threshold homomorphic cryptosystem based on class groups
From MaRDI portal
Cites work
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- An improved threshold homomorphic cryptosystem based on class groups
- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Efficient range proofs with transparent setup from bounded integer commitments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 5009201 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 2081074 (Why is no real title available?)
- scientific article; zbMATH DE number 1504548 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On sigma-protocols and (packed) black-box secret sharing schemes
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure distributed key generation for discrete-log based cryptosystems
- Secure multiparty computation from threshold encryption based on class groups
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
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 Q6915710)
