[PDF] Top 20 More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
Has 10000 "More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries" found on our website. Below are the top 20 most common "More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries".
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
... of oblivious transfers must be run, which can become prohibitively ...with security in the presence of active adversaries of [PVW08] achieves approximately 350 random OTs per second on standard ...OT ... See full document
36
What Security Can We Achieve within 4 Rounds?
... same security guar- ...an oblivious- transfer protocol that is vulnerable to input dependent abort by a malicious sender to full ...learn more than one output and extracting a ... See full document
54
Security and Efficiency Analysis of The Hamming Distance Computation Protocol Based On Oblivious Transfer
... raises more security and privacy issues. The primary security issue is the protection of the plain biometric templates against malicious adversary because they cannot be replaced with a new ... See full document
10
Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
... of efficient OT extension protocols [Bea96a], where a large number of OT executions can be obtained from a smaller number of “base” OT executions and symmetric key ...as efficient as possible presents a ... See full document
23
Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption
... new efficient, provably secure membership encryption scheme and have applied it to develop an efficient 1-out-of-n POT ...have more efficient scheme that combines both of them in a single ... See full document
20
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
... various extensions/variants of the plain UC framework in which secure computation can be achieved [8], with notable examples being the assumption of a common reference string (CRS) [7, 9, 11] or a public-key ... See full document
37
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
... adaptive security, blackbox-usage of the seed OTs is not possible in our construction since it would violate the results of [LZ13, ...adaptive adversaries, imply OT protocol secure against static ... See full document
58
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries
... on efficient 4 distributed RSA key generation was started with the seminal result of Boneh and Franklin ...an efficient al- gorithm for verifying biprimality of a modulus without knowledge of its ...the ... See full document
65
Extending Oblivious Transfer Efficiently, or - How to get active security with constant cryptographic overhead
... the extension. Beaver showed that if one starts with say n seeds, it is possi- ble to obtain any polynomial number (in n) of extended OTs. His solution is very elegant and concerns feasibility, but it is inherently ... See full document
19
Are you The One to Share? Secret Transfer with Access Structure
... secret transfer with access structure, with the aim of revealing as little information as ...on oblivious polynomial evaluation, and the other one is based on a new variant of garbled Bloom ...stronger ... See full document
24
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries
... Advantages Over Previous Input Consistency Proofs. Note that the number of commit- ments in Protocol 3.2 is only 2s for every circuit. In the online/offline setting, the number of circuits is very small (typically 5-10, ... See full document
32
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
... [13]. Security is achieved by the fact that the randomness is kept secret throughout the computation, and so any cheating by the adversary will be ...for malicious adversaries up to an additive ... See full document
31
On the Feasibility of Extending Oblivious Transfer
... obliviously transfer n random bits. The actual oblivious transfer is carried out by applying a universal hash function to the random strings and using the result to mask the actual bits being ...for ... See full document
27
On the Feasibility of Extending Oblivious Transfer
... obliviously transfer n random bits. The actual oblivious transfer is carried out by applying a universal hash function to the random strings and using the result to mask the actual bits being ...for ... See full document
27
Oblivious Transfer in Incomplete Networks
... compute oblivious transfer (OT) information theoretically securely against a general adversary structure in an incomplete network of reliable, private ... See full document
43
Supersingular Isogeny Oblivious Transfer
... - SIOT. In section 4, we present a conclusion of the security analysis of the proposed protocol. An implementation of the proposed protocol is presented in section 5. In section 6, we present a performance ... See full document
23
Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-Honest Sender
... and security properties of programs making use of public key ...of more complicated ...a security and correctness proof of an implementation in a real-world programming ... See full document
16
Arithmetic Cryptography
... the more general LWE problem allows for such (rich cryptographic) objects, but LPN does not?” A simple answer would be: “LPN arithmetize but LWE ...much more accessible while still capturing most existing ... See full document
80
Analysis Of The Simulatability Of An Oblivious Transfer
... against malicious adversaries in plain model and it is a generally realizable ...simulation-based security of their ...simulation-based security guarantee, while in the case that the sender is ... See full document
5
TECHNIQUES FOR SECURING MULTIPARTY COMPUTATIONS
... for security against semi-honest adversaries inspired by Malkhi et al’s [9] Fairplay ...no more information than ...the security of the BMR protocol [10] addressing a flaw in their ... See full document
6
Related subjects