A new interactive hashing theorem

DOI10.1007/s00145-012-9139-0zbMath1350.94036OpenAlexW2119034454MaRDI QIDQ2442643

Omer Reingold, Iftach Haitner

Publication date: 1 April 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-012-9139-0

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

Analysis of Multivariate Hash Functions ⋮ On the power of secure two-party computation ⋮ On the Power of Secure Two-Party Computation ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducing complexity assumptions for statistically-hiding commitment
• Minimum disclosure proofs of knowledge
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Universal classes of hash functions
• Parallel coin-tossing and constant-round secure two-party computation
• On the Power of the Randomized Iterate
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Secure commitment against a powerful adversary
• Inaccessible entropy

This page was built for publication: A new interactive hashing theorem