Efficient succinct zero-knowledge arguments in the CL framework
From MaRDI portal
Recommendations
- An improved threshold homomorphic cryptosystem based on class groups
- Secure multiparty computation from threshold encryption based on class groups
- An efficient pairing-based shuffle argument
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
Cites work
- A Sender Verifiable Mix-Net and a New Proof of a Shuffle
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- An improved threshold homomorphic cryptosystem based on class groups
- Applied Cryptography and Network Security
- Bandwidth-efficient threshold EC-DSA
- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- scientific article; zbMATH DE number 1842502 (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}\)
- NIWI and new notions of extraction for algebraic languages
- On sigma-protocols and (packed) black-box secret sharing schemes
- P-signatures and Noninteractive Anonymous Credentials
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
- Public Key Cryptography - PKC 2005
- Public Key Cryptography – PKC 2004
- Removing the strong RSA assumption from arguments over the integers
- Secure multiparty computation from threshold encryption based on class groups
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Two-party ECDSA from hash proof systems and efficient instantiations
- Two-sided malicious security for private intersection-sum with cardinality
- Verifiable Shuffle of Large Size Ciphertexts
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
This page was built for publication: Efficient succinct zero-knowledge arguments in the CL framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665550)
