Pages that link to "Item:Q5458603"
From MaRDI portal
The following pages link to Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (Q5458603):
Displaying 18 items.
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Shuffle invariance of the super-RSK algorithm (Q696799) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- An optimized inner product argument with more application scenarios (Q2673065) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle (Q2894413) (← links)
- Formal and Precise Analysis of Soundness of Several Shuffling Schemes (Q4933216) (← links)
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption (Q6134817) (← links)
- Lattice-Based Proof of a Shuffle (Q6166544) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments (Q6637547) (← links)
- Efficient succinct zero-knowledge arguments in the CL framework (Q6665550) (← links)
