On publicly-accountable zero-knowledge and small shuffle arguments
From MaRDI portal
Publication:2061977
DOI10.1007/978-3-030-75248-4_22zbMath1480.94025OpenAlexW3157383087MaRDI QIDQ2061977
Nils Fleischhacker, Mark Simkin
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_22
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A uniform-complexity treatment of encryption and zero-knowledge
- Instantaneous decentralized poker
- How to construct constant-round zero-knowledge proof systems for NP
- Black-box transformations from passive to covert security with public verifiability
- Quisquis: a new design for anonymous cryptocurrencies
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Constrained Pseudorandom Functions and Their Applications
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- A Framework for Efficient and Composable Oblivious Transfer
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- Calling Out Cheaters: Covert Security with Public Verifiability
- From Weak to Strong Zero-Knowledge and Applications
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Functional Signatures and Pseudorandom Functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- On the Size of Pairing-Based Non-interactive Arguments
- Verifiable Shuffle of Large Size Ciphertexts
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
This page was built for publication: On publicly-accountable zero-knowledge and small shuffle arguments
