New realizations of somewhere statistically binding hashing and positional accumulators

DOI10.1007/978-3-662-48797-6_6zbMATH Open1396.94093OpenAlexW2293089436MaRDI QIDQ2811128FDOQ2811128

Authors: Tatsuaki Okamoto, Krzysztof Pietrzak, Brent Waters, 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

Recommendations

• Somewhere statistically binding commitment schemes with applications
• A new interactive hashing theorem
• scientific article; zbMATH DE number 1775397
• Somewhere statistical soundness, post-quantum security, and SNARGs
• Robust property-preserving hash functions for Hamming distance and more

Mathematics Subject Classification ID

Cryptography (94A60)

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
• Adaptive succinct garbled RAM or: how to delegate your database
• Logarithmic-size (linkable) threshold ring signatures in the plain model
• Universal ring signatures in the standard model
• 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
• Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
• 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)