[PDF] Top 20 Non-Interactive Secure Computation from One-Way Functions
Has 10000 "Non-Interactive Secure Computation from One-Way Functions" found on our website. Below are the top 20 most common "Non-Interactive Secure Computation from One-Way Functions".
Non-Interactive Secure Computation from One-Way Functions
... adversary from gaining undue advantage by reset- ting the stateless token that it receives from the honest ...adversary from resetting the token and changing its input in each interaction with the ... See full document
22
New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation
... queries from Goldman Sachs – indeed, Goldman Sachs should learn nothing at all except that the client performed an authorized ...in one session, a client can only learn the answer to a single query of a ... See full document
25
Non-Interactive Secure Computation Based on Cut-and-Choose
... only one round of interaction, we require that all the randomness used for the second message of the OT queries for circuit gc i , is also derived from the PRF key seed i ... See full document
14
Mix-Compress-Mix Revisited: Dispensing with Non-invertible Random Injection Oracles
... trapdoor one-way permutation (in construction of TE) and the latter uses a one-way permutation (in construction of ...computationally secure (trapdoor) one-way ...hash ... See full document
21
Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions
... use. From a result shown in [GLP + 15], we can obtain a constant-round κ-robust one-one CCA-secure commitment scheme from one-way functions for every constant κ ∈ N ... See full document
38
Multi-Client Non-Interactive Verifiable Computation
... The scheme described above works only for a single evaluation of f . To ac- commodate multiple evaluations of f , Gennaro et al. propose the use of fully homomorphic encryption (FHE) in the following way. The ... See full document
20
Cryptographic Hashing From Strong One-Way Functions
... public-coin) interactive proof systems into non-interactive argument ...systems. One such formal result is stated in Theorem ...exponentially secure one-way ... See full document
51
Adaptively Secure Garbled Circuits from One-Way Functions
... on one-way ...to secure function evaluation (SFE) starting with Yao’s work, but also in parallel cryptography [AIK04, AIK05], verifiable computation [GGP10, AIK10], software protection [GKR08, ... See full document
37
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
... when one compares in detail the two physical devices. Indeed, PUFs are non-programmable and thus provide unpredictability ...protected from physical attacks and thus the functionalities that they ... See full document
53
On the Existence of Extractable One-Way Functions
... knowledge from an adver- sary is to run it on multiple related inputs to deduce what it “knows” from the resulting ...limited. One main limitation of rewinding-based extraction is that it requires ... See full document
42
Publicly Verifiable Non-Interactive Arguments for Delegating Computation
... differs from previous works such as [KRR14], which focused on general transformations obtained by applying any PIR scheme to any PCP with strong enough soundness properties (see ... See full document
79
Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions
... our non generic transformation shows that, using structural properties of the original schemes, it is possible to achieve CCA-security even at lower costs and surprisingly without a lot of additional ...universal ... See full document
18
Reusable Non-Interactive Secure Computation
... Our rNISC/OLE protocol is information-theoretic and does not rely on any cryptographic as- sumptions. Its complexity is polynomial in the size of an arithmetic branching program being computed. This is sufficient to ... See full document
54
Hardness of Non-Interactive Differential Privacy from One-Way Functions
... of one-way functions, we believe our results are an important step towards proving hardness results for simpler families of ...for non-interactive differential privacy from ... See full document
27
Succinct Non-Interactive Secure Computation
... candidate non-succinct NISC protocols for use in our main ...constructed from just a notion of “weak oblivious transfer” (see Appendix ...onto one-way function, which cannot necessarily be ... See full document
41
Non-Interactive Secure Multiparty Computation
... However, one could easily adapt the above definitions to capture statistical security and computational ...obfuscation from the ...results from [4] apply and one can only hope to get general ... See full document
43
Feasibility and Infeasibility of Secure Computation with Malicious PUFs
... as one of the goals of using PUFs is to avoid reliance on trusted ...for secure computation in the malicious-PUF model under additional, number-theoretic ... See full document
21
One-Way Functions and (Im)perfect Obfuscation
... The goal of program obfuscation is to transform a given program (say described as a boolean circuit) into another “scrambled” circuit which is functionally equivalent by “hiding” its implementation details (making it ... See full document
26
On Tightly Secure Non-Interactive Key Exchange
... efficiently from various computational assumptions (such as the DDH [13], `-Linear [31], DCR [13], or QR [13] ...mildly secure NIKE scheme into one that satisfies a stronger form of security (dubbed ... See full document
32
Building Lossy Trapdoor Functions from Lossy Encryption
... trapdoor functions were created as a building block for IND-CCA secure encryption, lossy encryption was initially created to help prove security against an active adversary in the Multiparty Compu- tation ... See full document
16
Related subjects