[PDF] Top 20 On Black-Box Complexity of Universally Composable Security in the CRS model
Has 10000 "On Black-Box Complexity of Universally Composable Security in the CRS model" found on our website. Below are the top 20 most common "On Black-Box Complexity of Universally Composable Security in the CRS model".
On Black-Box Complexity of Universally Composable Security in the CRS model
... paradigm). Security is typically proven with respect to two adversarial models: the semi-honest model (where the adversary follows the instructions of the protocol but tries to learn more than it should ... See full document
47
Composable Security in the Tamper Proof Hardware Model under Minimal Complexity
... token model, realizing this primitive turns out to be ...token model necessarily must rely on a zero-knowledge proof that is black-box in the underlying commitment ...are ... See full document
63
Universally Composable Firewall Architectures using Trusted Hardware
... The protection from attacks from outside the network is a well understood problem and has become the business model of many companies. Firewalls are considered a secure black box which protects the ... See full document
16
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
... is black-box, (2) the protocol is universally composable in the plain model, and (3) the number of rounds is ...The security of our protocol is proven in angel-based UC ... See full document
39
Universally Composable Secure Computation with Corrupted Tokens
... token model as a physical assumption in theory, in practice it degenerates into a model where the security of an honest player depends on the honest behavior of an external player chosen by the ... See full document
40
Universally composable privacy preserving finite automata execution with low online and offline complexity
... arithmetic black box (ABB) ...the complexity of our protocols is largely ...online complexity of evaluating it on an input string requires a small constant number of operations per ... See full document
16
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
... realistic security notion in the concurrent setting, Canetti [Can01] proposed uni- versally composable (UC) ...UC security is composability, which guarantees that UC-secure protocols can be composed ... See full document
56
Universally Composable Security With Local Adversaries
... of security for multi-party protocols models adversaries (both real and ideal) as centralized entities that control all parties that deviate from the ...basic security properties such as secrecy of local ... See full document
75
Universally Composable Authentication and Key-exchange with Global PKI
... The Generalized UC Framework. As mentioned above, the environment Z in the basic UC experiment is unable to invoke protocols that share state in any way with the challenge protocol. In many scenarios, the challenge ... See full document
30
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
... access model (PAM) considers a scenario in which all PUFs in the system are trusted, but an adversary can access the PUF after a protocol execution is completed, even if at the end of the protocol the PUF is ... See full document
53
Efficiently Obfuscating Re-Encryption Program under DDH Assumption
... (in security pa- rameter) space, involves a constant number of group exponentiation operations in all ...the security of our encryption - re-encryption sustem sys- tem under the standard DDH ... See full document
26
On the Universally Composable Security of OpenStack
... behind security in the basic UC framework is that any adversary A attacking a protocol π should learn no more information than could have been obtained via the use of a simulator S attacking protocol ...the ... See full document
125
A Universally Composable Framework for the Privacy of Email Ecosystems
... 3. In Sections 6 and 7 we analyze a construction similar to the classical parallel mix of Golle and Juels [19], to illustrate the expressiveness of our model in a more practice-oriented protocol. We focus on the ... See full document
33
Model risk: illuminating the black box
... mental model of the way the world ...computational model according to just one of the four cultures of model users: that of solely the “ Con fi dent model users ” , or solely that of the “ ... See full document
59
Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
... mon) standard of full UC-security [Can01] was recently proposed by CO [CO15]. For m executions, it requires only 2 + m modular exponentiations for the sender and 2m modular exponentiations for the receiver. The ... See full document
23
Universally Composable secure TNC protocol based on IF-T binding to TLS
... The UC framework defines the security goal of a protocol by an ideal functionality, which acts as a trusted third party. A good property of UC is the composability: a protocol π communicating with an ideal ... See full document
15
On the Power of Rewinding Simulators in Functional Encryption
... IND-Security of the new scheme to that of the AIBE scheme. On the other hand, the new scheme is not SIM-Secure (with the respect to any simulation-based security definition for FE known in the literature). ... See full document
23
Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems
... All outputs from S 3 are distributed identically to the outputs of S 1 , assuming patching the random oracle does not fail. As argued previously, this only happens with negligible probability. Hence, when Z can ... See full document
43
Universally Composable Oblivious Transfer Protocol based on the RLWE Assumption
... a proposal for OT based on the RLWE assumption and achieving security in the UC-framework was presented. However, the scheme does not provide security for the receiver. More precisely, the signal function ... See full document
21
Universally Composable Non-Interactive Key Exchange
... prove security of our NIKE’ scheme from Definition ...weaker security notion for NIKE, which we call weakCKS ++ ...mentioned security notions for NIKE, an adversary against a NIKE scheme has to ... See full document
33
Related subjects