Minimizing locality of one-way functions via semi-private randomized encodings
From MaRDI portal
Publication:1747656
DOI10.1007/S00145-016-9244-6zbMATH Open1384.94026OpenAlexW2296500028MaRDI QIDQ1747656FDOQ1747656
Authors: Benny Applebaum, Yuval Ishai, Eyal Kushilevitz 
Publication date: 26 April 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9244-6
Recommendations
- Input locality and hardness amplification
- Input locality and hardness amplification
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Computationally private randomizing polynomials and their applications
- Encoding functions with constant online rate or how to compress garbled circuits keys
Cites Work
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Fuzzy Identity-Based Encryption
- Foundations of Cryptography
- Concentration of Measure for the Analysis of Randomized Algorithms
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Protecting circuits from computationally bounded and noisy leakage
- Candidate one-way functions based on expander graphs
- On the security of Goldreich's one-way function
- Advances in Cryptology - CRYPTO 2003
- Cryptography in $NC^0$
- Protecting data privacy in private information retrieval schemes
- On the one-way function candidate proposed by Goldreich
- Cryptographic hardness of random local functions. Survey
- Robust pseudorandom generators
- Title not available (Why is that?)
- Partial garbling schemes and their applications
- Predicate encryption for circuits from LWE
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Secure computation with information leaking to an adversary
- The Computational Benefit of Correlated Instances
Cited In (4)
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
This page was built for publication: Minimizing locality of one-way functions via semi-private randomized encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747656)
