Somewhere statistically binding commitment schemes with applications
From MaRDI portal
Publication:2145407
DOI10.1007/978-3-662-64322-8_21zbMATH Open1491.94048OpenAlexW3210392068MaRDI QIDQ2145407FDOQ2145407
Authors: Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim 
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_21
Recommendations
- New realizations of somewhere statistically binding hashing and positional accumulators
- Statistical secrecy and multibit commitments
- scientific article; zbMATH DE number 1942445
- Secure database commitments and universal arguments of quasi knowledge
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Title not available (Why is that?)
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Advances in Cryptology – CRYPTO 2004
- Improving the Security of Quantum Protocols via Commit-and-Open
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- An algebraic framework for Diffie-Hellman assumptions
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Automata, Languages and Programming
- Quisquis: a new design for anonymous cryptocurrencies
- Vector commitments and their applications
- New realizations of somewhere statistically binding hashing and positional accumulators
- On the communication complexity of secure function evaluation with long output
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Square span programs with applications to succinct NIZK arguments
- New Techniques for Non-interactive Shuffle and Range Arguments
- Trapdoor hash functions and their applications
- Maliciously secure oblivious linear function evaluation with constant overhead
- QA-NIZK arguments in asymmetric groups: new tools and new constructions
- Shorter quadratic QA-NIZK proofs
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Shorter pairing-based arguments under standard assumptions
- QA-NIZK arguments of same opening for bilateral commitments
Cited In (9)
- On black-box knowledge-sound commit-and-prove SNARKs
- Title not available (Why is that?)
- New realizations of somewhere statistically binding hashing and positional accumulators
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- Reducing complexity assumptions for statistically-hiding commitment
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Rate-1 fully local somewhere extractable hashing from DDH
- Secure database commitments and universal arguments of quasi knowledge
- Fully-succinct publicly verifiable delegation from constant-size assumptions
This page was built for publication: Somewhere statistically binding commitment schemes with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145407)
