One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

DOI10.1007/978-3-540-70936-7_23MaRDI QIDQ3596393zbMATH OpenOpenAlexFDO

Authors 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 boundsInteractive hashingstatistically hiding commitments

Mathematics Subject Classification ID

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

Recommendations

• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Reducing complexity assumptions for statistically-hiding commitment
• Statistically-hiding commitment from any one-way function
• A new interactive hashing theorem
• Construction and application of a perfectly hiding commitment scheme based on one-way functions

Cited in

(18)

• On the ring-LWE and polynomial-LWE problems
• On constructing one-way permutations from indistinguishability obfuscation
• A new interactive hashing theorem
• On derandomizing Yao's weak-to-strong OWF construction
• On constructing one-way permutations from indistinguishability obfuscation
• Limits on the usefulness of random oracles
• Multi-input functional encryption with unbounded-message security
• Limits on the power of indistinguishability obfuscation and functional encryption
• Statistically-hiding commitment from any one-way function
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Possibility and impossibility results for selective decommitments
• Inaccessible entropy
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Reducing Complexity Assumptions for Statistically-Hiding Commitment
• A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
• Automata, Languages and Programming
• Doubly adaptive zero-knowledge proofs
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596393)