Pages that link to "Item:Q2894413"
From MaRDI portal
The following pages link to Efficient Zero-Knowledge Argument for Correctness of a Shuffle (Q2894413):
Displaying 36 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Shuffle invariance of the super-RSK algorithm (Q696799) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- New Techniques for Non-interactive Shuffle and Range Arguments (Q2822687) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- (Q4783736) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (Q5458603) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- How to Challenge and Cast Your e-Vote (Q5857773) (← links)
- Public Key Cryptography – PKC 2004 (Q5901811) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption (Q6134817) (← links)
- OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks (Q6487221) (← links)
- Maliciously Secure Multi-Client ORAM (Q6487223) (← links)
- Scored anonymous credentials (Q6535132) (← links)
- Practical construction for secure trick-taking games even with cards set aside (Q6573960) (← links)
- Non-interactive anonymous router with quasi-linear router computation (Q6582211) (← links)
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk (Q6635764) (← links)
- Succinct verification of compressed sigma protocols in the updatable SRS setting (Q6635775) (← links)
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO (Q6637544) (← links)
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments (Q6637547) (← links)
- Mangrove: a scalable framework for folding-based SNARKs (Q6660304) (← links)
- Efficient succinct zero-knowledge arguments in the CL framework (Q6665550) (← links)
