Somewhere statistically binding commitment schemes with applications
From MaRDI portal
Publication:2145407
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
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Automata, Languages and Programming
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Improving the Security of Quantum Protocols via Commit-and-Open
- Maliciously secure oblivious linear function evaluation with constant overhead
- New Techniques for Non-interactive Shuffle and Range Arguments
- New realizations of somewhere statistically binding hashing and positional accumulators
- On the communication complexity of secure function evaluation with long output
- P-signatures and Noninteractive Anonymous Credentials
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- QA-NIZK arguments in asymmetric groups: new tools and new constructions
- QA-NIZK arguments of same opening for bilateral commitments
- Quadratic span programs and succinct NIZKs without PCPs
- Quisquis: a new design for anonymous cryptocurrencies
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Shorter pairing-based arguments under standard assumptions
- Shorter quadratic QA-NIZK proofs
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Square span programs with applications to succinct NIZK arguments
- Trapdoor hash functions and their applications
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Vector commitments and their applications
Cited in
(9)- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Secure database commitments and universal arguments of quasi knowledge
- Reducing complexity assumptions for statistically-hiding commitment
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- scientific article; zbMATH DE number 1024061 (Why is no real title available?)
- Rate-1 fully local somewhere extractable hashing from DDH
- On black-box knowledge-sound commit-and-prove SNARKs
- New realizations of somewhere statistically binding hashing and positional accumulators
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
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)
