(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond
From MaRDI portal
Publication:3457067
DOI10.1007/978-3-662-48000-7_11zbMath1351.94074OpenAlexW1444969731MaRDI QIDQ3457067
Jian Weng, Yu Yu, Da-Wu Gu, Xiang-Xue Li
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_11
Related Items (4)
Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Simple constructions from (almost) regular one-way functions ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ Unnamed Item
Cites Work
- Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
- UOWHFs from OWFs: Trading Regularity for Efficiency
- Universal One-Way Hash Functions via Inaccessible Entropy
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- On the Existence of Pseudorandom Generators
- Foundations of Cryptography
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- A Cookbook for Black-Box Separations and a Recipe for UOWHFs
- The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions
- Bounds on the Efficiency of Generic Cryptographic Constructions
- On the Power of the Randomized Iterate
This page was built for publication: (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond
