New Techniques for Non-interactive Shuffle and Range Arguments
From MaRDI portal
Publication:2822687
DOI10.1007/978-3-319-39555-5_23zbMath1346.94103OpenAlexW2478442419MaRDI QIDQ2822687
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_23
Related Items (7)
On QA-NIZK in the BPK Model ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Election control through social influence with unknown preferences
Cites Work
- Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
- QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
- An Algebraic Framework for Diffie-Hellman Assumptions
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Universally Composable Adaptive Priced Oblivious Transfer
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- Perfect Non-interactive Zero Knowledge for NP
- Efficient Protocols for Set Membership and Range Proofs
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- A Non-interactive Shuffle with Pairing Based Verifiability
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
This page was built for publication: New Techniques for Non-interactive Shuffle and Range Arguments
