one-way functions exist
Hardness of Non-Interactive Differential Privacy from One-Way Functions
... assuming one- way functions exist, there is no polynomial-time differentially private algorithm that takes a dataset D ∈ X n and a set of ˜ O(n 2 ) arbitrary statistical queries and outputs an ...
27
There is no Indistinguishability Obfuscation in Pessiland
... where one-way functions exist but public-key encryption is not possible, is ruled out due to the existing constructions of public-key crypto from iO and one-way ...but ...
5
Monotone Circuits: One-Way Functions versus Pseudorandom Generators
... of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that ...
8
CBEAM: Efficient Authenticated Encryption from Feebly One-Way $\phi$ Functions
... mixing functions can be constructed from low-degree rotation-invariant φ functions rather than conven- tional ...novel functions have surprising properties; many exhibit inherent feeble (Boolean ...
19
One-Way Functions and (Im)perfect Obfuscation
... have been demonstrated, e.g., general-purpose functional encryption scheme [GGH + 13], deniable encryption with negligible advantage [SW14], two-round secure MPC [GGHR14], traitor-tracing schemes with very short messages ...
26
Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgrd Constructions
... hash functions [15], and quantum security of NMAC ...are one-way permutations or functions, and do not treat the usual sponge functions that are constructed from public ...(compression ...
60
Cryptographic Hashing From Strong One-Way Functions
... • An optimal parallel repetition theorem for the hardness of F, i.e. one which states that if a function f ← F is (s, δ)-hard to invert, then its k-wise repetition f k is (s, δ k )-hard to invert. However, such a ...
51
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
... of one-way functions that are secure against sub-exponential-time adversaries and constant-round semi-honest oblivious transfer protocols that are secure against quasi-polynomial-time ...black-box ...
39
On the Existence of Extractable One-Way Functions
... Two-message zero-knowledge arguments against adversaries with unbounded polynomial advice exist only for trivial languages (regardless of how simulation is done) [GO94]. In fact, impossibility extends even to ...
42
An Elementary Proof That Well Behaved Utility Functions Exist
... To be a bit more precise, measure theory starts out by first defining the “size”—measure—of a class of “sim- ple” sets, such as bounded intervals on the real line or rectangles in the plane, and then extends this ...
8
Nose and lungs: one way, one disease
... air- way disease, defined as a reduction in forced expiratory flow (FEF) at 25–75% of the pulmonary volume and a normal spirometry, is suggested to be a marker of early allergic or inflammatory involvement of the ...
5
(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-way Functions and Beyond
... UOWHFs from any OWFs. The principle possibility result that UOWHFs can be based on any OWF was established by Rompel [19] (with some corrections given in [20, 16]). However, Rompel’s construction was quite complicated ...
30
New modified 256 bit MD5 Algorithm with SHA Compression Function
... MD stands for „Message Digest‟ and describes a mathematical function that can take place on a variable length string. The number 5 simply depicts that MD5 was the successor to MD4. MD5 is essentially a checksum that is ...
5
An Efficient Multistage Secret Sharing Scheme Using Linear One-way Functions and Bilinear Maps
... A One-Stage Multisecret Sharing (OSMSS) scheme is a special case of MSSS schemes that all secrets are recovered simulta- ...linear one-way functions, we show that the previous schemes can be ...
10
Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes
... Hardness of the Decoding Problem. All code-based cryptography relies upon that problem. Here we are in a case where there are multiple solutions of (3) and the adversary may produce any number of instances of (3) with ...
63
‘Only one way in and one way out’: Staging Utopian Spaces
... of one another on the table ...finally one person is lying on the floor, a rope coiled around their waist which follows the line of an outstretched arm to the ...and one which is ...
19
How to Generate and use Universal Samplers
... no way that a simulator can publish sampler parameters U of polynomial size, and then with no further interaction with the adversary, force Sample(U, d ∗ ) = d ∗ (F (d ∗ )) for a d ∗ chosen after U has already ...
52
Cryptography with One-Way Communication
... generally one combination from a list of possible choices) is flipped then the receiver outputs m while on the other hand flipping of another combination makes the receiver output 1 − ...must exist two ...
37
Limits on the Power of Garbling Techniques for Public-Key Encryption
... Public-key encryption (PKE) [DH76, RSA78] is a fundamental primitive in cryptography and un- derstanding what assumptions are sufficient for realizing it is a foundational goal. Decades of research have provided us with ...
60
Lower Bounds on Assumptions behind Indistinguishability Obfuscation
... box way) trivially exist relative to the idealized model of random ...black-box way (e.g., CCA secure public key encryption) are known to exist in the random TDP model ...black-box way) ...
18