New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
From MaRDI portal
Publication:2811128
DOI10.1007/978-3-662-48797-6_6zbMath1396.94093OpenAlexW2293089436MaRDI QIDQ2811128
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
Related Items (19)
A simple construction of iO for Turing machines ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Credibility in private set membership ⋮ Laconic function evaluation for Turing machines ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ SNARGs for monotone policy batch NP ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Universal ring signatures in the standard model ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Tightly secure ring signatures in the standard model ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
This page was built for publication: New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
