Minimizing locality of one-way functions via semi-private randomized encodings

DOI10.1007/S00145-016-9244-6MaRDI QIDQ1747656zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

one-way functionNC0randomized encodingleakage resilientlocal cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Candidate one-way functions based on expander graphs
• Concentration of Measure for the Analysis of Randomized Algorithms
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Cryptographic hardness of random local functions. Survey
• Cryptography in $NC^0$
• Foundations of Cryptography
• Fuzzy Identity-Based Encryption
• On the one-way function candidate proposed by Goldreich
• On the security of Goldreich's one-way function
• Partial garbling schemes and their applications
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Predicate encryption for circuits from LWE
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Protecting circuits from computationally bounded and noisy leakage
• Protecting data privacy in private information retrieval schemes
• Robust pseudorandom generators
• Secure computation with information leaking to an adversary
• The Computational Benefit of Correlated Instances

Cited in

(4)

• From private simultaneous messages to zero-information Arthur-Merlin protocols and back
• 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

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)