[PDF] Top 20 Efficient One-Sided Adaptively Secure Computation
Has 10000 "Efficient One-Sided Adaptively Secure Computation" found on our website. Below are the top 20 most common "Efficient One-Sided Adaptively Secure Computation".
Efficient One-Sided Adaptively Secure Computation
... NCE, adaptively secure OT and adaptively secure two-party ...presented one-sided NCE based on a weakened simulatable PKE ...constructions. Adaptively secure ... See full document
43
Insured MPC: Efficient Secure Computation with Financial Penalties
... allowing one to open linear combinations of commitments without revealing the individual commitments ...highly efficient and modular output secret sharing and reconstruction mecha- ...UC secure ... See full document
63
An Efficient 3-Factor Authentication for Secure Communication using Improved Smart Cards Authentication
... intended one whom he attempts to communicate with over an insecure ...for Secure Communication using Smart Cards provides efficient Security from various attacks, but provides high Computation ... See full document
5
Adaptively Secure Distributed PRFs from LWE
... In the context of threshold cryptography, adaptive security has been addressed in a large body of work [20,31,44,48,1,6]. These techniques, however, require interaction (except in some cases in which all players always ... See full document
44
Adaptively Secure MPC with Sublinear Communication Complexity
... the one hand, we extend the impossibility result of FHE [75] to rule out adaptively secure 2-round Alice-optimized protocols (even assuming secure ...an adaptively secure, ... See full document
72
Efficient data intensive secure computation : fictional or real
... intensive secure computation. One approach is by designing better data ...parallelize computation, which can greatly reduce the overall cost if the computation task is data ... See full document
11
Fair and Efficient Secure Multiparty Computation with Reputation Systems
... of secure computation, we are given a fixed m-ary function and our goal is to construct a secure m-party protocol π for computing f ...is secure as long as the majority of the parties are ... See full document
20
Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction
... Pairings. Pairing-based cryptography is demanded in most cryptographic so- lutions like one round tripartite key exchange in Joux [26], identity-based en- cryption scheme in [9] and short signatures of Boneh, ... See full document
37
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits
... two-party computation, equivocating the view of the garbled circuit constructor requires heavy machinery such as in Canetti et ...an adaptively corrupted prover’s view of the OT proto- col, as per the ... See full document
47
SHADE: Secure HAmming DistancE computation from oblivious transfer
... more efficient in terms of computation time and band- width ...algorithm, one needs to describe the function as a binary circuit and then “garble” every gate of this circuit to a table of 4 sym- ... See full document
20
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
... We also wish to remark that the ability to extract without rewinding B turns out to be a very useful tool during concurrent security proofs, and we expect this will have significant applications elsewhere. This ... See full document
34
From FE Combiners to Secure MPC and Back
... to secure MPC: Our first result shows how to construct a passively secure multi-party computation protocol that is both round-optimal (two rounds) and communication efficient (depends only on ... See full document
51
Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values
... CMTB relies on Goyal et al.’s [14] random seed check, which was implemented by Kreuter et al. [27] to combat generation of incorrect circuits. This technique uses a cut- and-choose style protocol to determine whether the ... See full document
15
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, GIS + ... See full document
37
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption
... is secure for any a priori bounded number of ...(i.e., one that uses a symmetric session key as the payload) of our scheme similar to ...is secure in the standard simulation-based security ...log ... See full document
63
Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
... FHE has several applications. As just one example, FHE can be used to construct simple protocols for secure computation. We restrict ourselves to the two-party setting with honest-but- curious ... See full document
19
Adaptively Secure Broadcast Encryption with Small System Parameters
... be secure against a chosen ciphertext attack, where the adversary is additionally given access to a decryption ...a one-time signature into the ciphertext, and sign the resulting ciphertext using the ... See full document
40
Adaptively Secure Fully Homomorphic Signatures Based on Lattices
... to adaptively secure FHS, ...that one can use normal signature scheme plus NIZK to achieve adaptively secure homomorphic ...to adaptively secure homomorphic ...more ... See full document
25
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
... Proof of security: We provide a brief proof sketch showing that our simulation is correct. Upto n − 1 corruptions, it is easy to show that the joint view of all parties are indistinguishable. This follows from the fact ... See full document
54
Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
... General purpose Equivocal FHE. We mention for completeness that there is also a more generic ap- proach which will give us adaptive security based only on our Equivocal FHE: namely, we follow the same blueprint as ... See full document
31
Related subjects