Somewhere statistically binding commitment schemes with applications
From MaRDI portal
Publication:2145407
DOI10.1007/978-3-662-64322-8_21zbMath1491.94048OpenAlexW3210392068MaRDI QIDQ2145407
Helger Lipmaa, Zaira Pindado, Janno Siim, Prastudy Fauzi
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_21
Related Items (3)
Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Shorter pairing-based arguments under standard assumptions
- Quisquis: a new design for anonymous cryptocurrencies
- Shorter quadratic QA-NIZK proofs
- Trapdoor hash functions and their applications
- Maliciously secure oblivious linear function evaluation with constant overhead
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
- New Techniques for Non-interactive Shuffle and Range Arguments
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
- An Algebraic Framework for Diffie-Hellman Assumptions
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Square Span Programs with Applications to Succinct NIZK Arguments
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Improving the Security of Quantum Protocols via Commit-and-Open
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Vector Commitments and Their Applications
- Quadratic Span Programs and Succinct NIZKs without PCPs
- QA-NIZK Arguments of Same Opening for Bilateral Commitments
- Advances in Cryptology – CRYPTO 2004
- Separating succinct non-interactive arguments from all falsifiable assumptions
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Automata, Languages and Programming
This page was built for publication: Somewhere statistically binding commitment schemes with applications
