搜索结果: 1-15 共查到“one-way functions”相关记录33条 . 查询时间(0.129 秒)
Theory and application of computationally independent one-way functions: Interactive proof of ability - Revisited
one-way functions zero knowledge proof computational independence
2019/4/1
We introduce the concept of computationally independent pair of one-way functions (CI-OWF). We also provide two rich classes of examples of such functions based on standard assumptions. We revisit two...
Distributional Collision Resistance Beyond One-Way Functions
statistically hiding commitments distributional collision resistance
2019/2/27
Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision (x,y) where x is uniformly random and y is uniformly random conditi...
Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgård Constructions
provable security Davies-Meyer one-wayness, non-invertibility
2018/11/16
We present hash functions that are almost optimally one-way in the quantum setting. Our hash functions are based on the Merkle-Damgård construction iterating a Davies-Meyer compression function, ...
Non-Interactive Secure Computation from One-Way Functions
Secure Computation Hardware Tokens
2018/11/2
The notion of non-interactive secure computation (NISC) first introduced in the work of Ishai et al. [EUROCRYPT 2011] studies the following problem: Suppose a receiver R wishes to publish an encryptio...
An interesting consequence of our results is a potential new avenue for bypassing black-box separations. In particular, proving (with necessarily non-black-box techniques) that parallel repetition amp...
Hardness of Non-Interactive Differential Privacy from One-Way Functions
differential privacy one-way functions traitor tracing
2017/11/21
A central challenge in differential privacy is to design computationally efficient noninteractive algorithms that can answer large numbers of statistical queries on a sensitive dataset. That is, we wo...
Leakage-Resilient Tweakable Encryption from One-Way Functions
Tweakable-weak PRF symmetric key tweakable weak hash proof system tweakable encryption
2017/5/31
In this paper, we initiate the study of leakage-resilient tweakable encryption schemes in the relative key-leakage model, where the adversary can obtain (arbitrary) partial information about the secre...
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
leakage resilience one-way function auxiliary input
2016/12/10
Most cryptographic schemes are designed in a model where perfect secrecy of the secret key is assumed. In most physical implementations, however, some form of information leakage is inherent and unavo...
Adaptively Secure Garbled Circuits from One-Way Functions
Adaptively Secure Garbled Circuits One-Way Functions
2016/1/26
A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output
C(x) but hides everything else. In many settings, the circuit can be garbled off-line without strict
e...
Pseudorandom Generators from Regular One-way Functions: New Constructions with Improved Parameters
Foundations Pseudorandom Generators One-way Functions Randomized Iterate
2016/1/23
We revisit the problem of basing pseudorandom generators on regular one-way functions, and present the following constructions.
One-Way Functions and (Im)perfect Obfuscation
one-way functions indistinguishability obfuscation
2016/1/9
A program obfuscator takes a program and outputs a “scrambled” version of it, where the
goal is that the obfuscated program will not reveal much about its structure beyond what is
apparent from exec...
The Randomized Iterate Revisited - Almost Linear Seed Length PRGs from A Broader Class of One-way Functions
Foundations Pseudorandom Generators One-way Functions
2016/1/9
We revisit “the randomized iterate” technique that was originally used by Goldreich, Krawczyk,
and Luby (SICOMP 1993) and refined by Haitner, Harnik and Reingold (CRYPTO 2006) in constructing
pseudo...
(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-way Functions and Beyond
Universal One-way Hash Functions One-way functions Randomized Iterate
2016/1/9
We revisit the problem of black-box constructions of universal one-way hash functions (UOWHFs)
from several (from specific to more general) classes of one-way functions (OWFs), and give respective
c...
On the Existence of Extractable One-Way Functions
Extractable One-Way Functions any adversarial program
2016/1/9
A function f is extractable if it is possible to algorithmically “extract,” from any adversarial program
that outputs a value y in the image of f, a preimage of y. When combined with hardness propert...
Yao’s garbled circuit construction is a fundamental construction in cryptography and recent effi-
ciency optimizations have brought it much closer to practice. However these constructions work only f...
