Efficient succinct zero-knowledge arguments in the CL framework

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Practical fully secure unrestricted inner product functional encryption modulo $p$
Bandwidth-efficient threshold EC-DSA
Compact zero-knowledge proofs for threshold ECDSA with trustless setup
Two-sided malicious security for private intersection-sum with cardinality
Two-party ECDSA from hash proof systems and efficient instantiations
Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
Applied Cryptography and Network Security
P-signatures and Noninteractive Anonymous Credentials
A Sender Verifiable Mix-Net and a New Proof of a Shuffle
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
Public Key Cryptography - PKC 2005
Removing the Strong RSA Assumption from Arguments over the Integers
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Verifiable Shuffle of Large Size Ciphertexts
Public Key Cryptography – PKC 2004
Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
NIWI and new notions of extraction for algebraic languages
Secure multiparty computation from threshold encryption based on class groups
On sigma-protocols and (packed) black-box secret sharing schemes
An improved threshold homomorphic cryptosystem based on class groups

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)