[PDF] Top 20 On the Universally Composable Security of OpenStack
Has 10000 "On the Universally Composable Security of OpenStack" found on our website. Below are the top 20 most common "On the Universally Composable Security of OpenStack".
On the Universally Composable Security of OpenStack
... We then construct a new, stronger one-time token mechanism that is a more stringent variant of the mechanism proposed in [25], and we prove that this mechanism suffices for realizing an ideal cloud that provides some ... See full document
125
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 network from attacks. ... See full document
16
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 Secure Computation with (Malicious) Physically Uncloneable Functions
... strong security guarantees (like UC) by allowing parties to use hardware boxes that have certain security ...of security required from such a hardware box is that of tamper-proofness ; ...UC ... See full document
53
Universally Composable Authentication and Key-exchange with Global PKI
... The works of [MTC13, KMO + 14], which are set in the Abstract Cryptography setting of [MR11], have a similar modeling shortcoming: the public key infrastructure is modeled as local to the protocol instance. Furthermore, ... See full document
30
Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems
... the security requirements a reputation system has to fulfill include - but are not limited to - anonymity for raters, unforgeability and public linkability of ratings, and the ability to determine the raters’ ... See full document
43
A Universally Composable Framework for the Privacy of Email Ecosystems
... Remark 2 (Unobservability as a golden standard for email privacy). In our UC formalization of e-mail ecosystems, we consider a dynamic scenario where the clients register, go online/offline and make custom fetch ... See full document
33
Universally Composable Secure Computation with Corrupted Tokens
... Other results and sub-protocols. As an additional result, we improve the result of [37] by removing the need of collision-resistant hash functions, and apply our transformation to obtain an obfuscation protocol in the ... See full document
40
Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption
... [19]. Security is proven in a static corruption model without relying on random oracles under the Hidden Strong Diffie-Hellman, Triple Diffie-Hellman, Decisional linear and Square Decisional Bilinear ... See full document
20
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
ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement
... In addition to these two models of computation, the UC framework also considers the G-hybrid world, where the computation proceeds as in the real-world with the ad- ditional assumption that the parties have access to an ... See full document
35
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
... The universal composability (UC) framework [7] provides a way of analyzing protocols while en- suring strong security guarantees. In particular, protocols proven secure in this framework remain secure when run ... See full document
37
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
Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
... notion (static corruptions) in Theorem 4.3. However, as our main contribution, we mend the aforementioned problem by adding a random oracle G to the protocol description and thereby attaining greater flexibility in our ... 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 Black-Box Complexity of Universally Composable Security in the CRS model
... Our second observation is that in the context of one-sided adaptive security, it is sufficient to rely on a weaker variant of NCE, namely, one that is secure against only a single adaptive corruption [KO04, HP14]. ... See full document
47
Universally Composable Key-Management
... hardware security modules (HSM) or key-management servers to separate highly sensitive cryptographic operations from more vulnerable parts of the ...the security of APIs on the logical level adapting ... See full document
37
Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove
... formulating security in various areas of cryptography. However security definitions based on simulation are generally harder to work with than game based definitions, often resulting in more complicated ... See full document
34
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
... A more significant difference arises in the context of corruption. In the full UC model, an ideal functionality is modeled as a subroutine of the main protocol instance. Therefore, parties “send” messages/inputs to an ... See full document
42
Universally Composable Accumulators
... first universally composable (UC) treatment of cryptographic ...basic security properties of accumulators: correctness and ...the security proofs of existing systems that leverage such ... See full document
29
Related subjects