One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

DOI10.1007/978-3-540-70936-7_23zbMath1129.94039OpenAlexW2106029203MaRDI QIDQ3596393

Hoeteck Wee

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_23

zbMATH Keywords

black-box lower boundsstatistically hiding commitmentsInteractive hashing

Mathematics Subject Classification ID

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

Related Items (14)

Limits on the usefulness of random oracles ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ On the ring-LWE and polynomial-LWE problems ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Doubly adaptive zero-knowledge proofs ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Possibility and impossibility results for selective decommitments ⋮ A new interactive hashing theorem ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

This page was built for publication: One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments