[PDF] Top 20 Universally Composable Secure Computation with Corrupted Tokens
Has 10000 "Universally Composable Secure Computation with Corrupted Tokens" found on our website. Below are the top 20 most common "Universally Composable Secure Computation with Corrupted Tokens".
Universally Composable Secure Computation with Corrupted Tokens
... protocol secure against semi- honest adversary in the OT-hybrid model to get a protocol UC-secure against malicious adversaries in the setting of no honest ... See full document
40
David & Goliath Oblivious Affine Function Evaluation - Asymptotically Optimal Building Blocks for Universally Composable Two-Party Computation from a Single Untrusted Stateful Tamper-Proof Hardware Token
... a corrupted David into an unsimulatable attack by ...a corrupted David, we have that David’s inputs can be extracted from his communication with Goliath and the ...a corrupted David to compute ... See full document
58
On the Universally Composable Security of OpenStack
... Restricting tokens to be single use with specific parameters limits the scope of adversarial corrup- ...a corrupted service could store all tokens it sees and use them at ...since tokens are ... See full document
125
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
... a corrupted commitment sender may only with negligible probability find two distinct unveil messages x, x 0 such that p(x) and p(x 0 ) agree on the first quarter of their bit-string ...a corrupted ... See full document
29
Universally Composable Security With Local Adversaries
... A first attempt to bridge this gap would be to follow the formalisms of [ASV08,AKMZ12,MR11] and consider one adversary per party. However, this modeling does not completely capture reality either. Consider for instance ... See full document
75
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
... Composable security. The concurrent setting, in which many instances of protocols are executed concurrently in an arbitrary schedule, is a more general and realistic setting than the stand-alone one. In the ... See full document
39
Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
... for universally verifiable multiparty computation, and a practical construction achieving ...actively secure MPC protocols based on threshold homomorphic cryptosystems from ...the computation; ... See full document
32
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
... the universally composable security (UC) framework that is suitable for “standard” two-party and multiparty computation ...of secure computation and wish to work with universally ... See full document
42
Universally composable privacy preserving finite automata execution with low online and offline complexity
... 5. Martin Burkhart, Mario Strasser, Dilip Many, and Xenofontas Dimitropoulos. SEPIA: Privacy-preserving aggregation of multi-domain network events and statis- tics. In USENIX Security Symposium, pages 223–239, ... See full document
16
Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption
... provably secure membership encryption scheme and have applied it to develop an efficient 1-out-of-n POT ...is secure under universally composable framework and thus, unlike the existing ... See full document
20
On Black-Box Complexity of Universally Composable Security in the CRS model
... multi-party computation enables a set parties to mutually run a protocol that computes some function f on their private inputs, while preserving a number of security ...no corrupted party or parties can ... See full document
47
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
... same computation cost as ...adaptively- secure OT continued to remain open, which we try to address through our ...are secure in the plain ... See full document
58
Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds
... obtain universally composable computation in the presence of malicious adversaries corrupting half or more of the parties, even in a static-corruption ... See full document
26
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
... tamper-proof tokens themselves rather than obtain them from a trusted provider as in [34], and there is no assumption regarding what code a malicious party puts in a token it ...creates.) Secure hardware ... See full document
37
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
... The main contribution of this work consists in studying the security of protocols in presence of adversaries that can create malicious PUFs. Additionally, we will consider adversaries making “hidden” queries to PUFs (so ... See full document
53
Fine-Grained Secure Computation
... be secure. Starting with the work on secure multiparty computation [Yao82], and continuing with ZK proofs [GMR89], and more recently Fully Homomor- phic Encryption [Gen09], verifiable outsourcing ... See full document
33
ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement
... provably secure protocol for secure poker with financial rewards/penalties enforcement were recently proposed by David et ...are composable and, consequently, re-purposing them for playing other ... See full document
35
Using Indistinguishability Obfuscation via UCEs
... the computation of the CIH as an encryption operation and the CIH game becomes a slightly stronger version of the IND security game (that is, a real-or-random rather than a left-or-right ... See full document
38
Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
... remains secure even if the receiver is adaptively ...adaptively corrupted party, the simulator must forge, upon corruption of the party, a state of the corrupted ...statically corrupted and ... See full document
23
Large-Scale Secure Computation
... memory, computation, or communication resources on the order of the data of all ...seek secure protocols that tightly preserve the individual memory and computation requirements of each party with ... See full document
75
Related subjects