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
- Adaptive security for threshold cryptosystems
- Adaptive security in the threshold setting: From cryptosystems to signature schemes
- Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography
- Adaptively-secure optimal-resilience proactive RSA
- Advances in Cryptology - CRYPTO 2003
- 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?)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Non-interactive and information-theoretic secure verifiable secret sharing
- 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)