New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
From MaRDI portal
Publication:2811128
DOI10.1007/978-3-662-48797-6_6zbMATH Open1396.94093OpenAlexW2293089436MaRDI QIDQ2811128FDOQ2811128
Brent Waters, Tatsuaki Okamoto, Krzysztof Pietrzak, Daniel Wichs
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_6
Cited In (25)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- On black-box knowledge-sound commit-and-prove SNARKs
- SNARGs for monotone policy batch NP
- Compact accountable ring signatures in the plain model
- A simple construction of iO for Turing machines
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Universal ring signatures in the standard model
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
- Registered (inner-product) functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Non-interactive batch arguments for NP from standard assumptions
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Credibility in private set membership
- Laconic function evaluation for Turing machines
- A note on non-interactive zero-knowledge from CDH
- Correlation intractability and SNARGs from sub-exponential DDH
- Tightly secure ring signatures in the standard model
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Rate-1 fully local somewhere extractable hashing from DDH
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Somewhere statistically binding commitment schemes with applications
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
This page was built for publication: New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811128)
