• No results found

[PDF] Top 20 A Universally Composable Treatment of Network Time

Has 10000 "A Universally Composable Treatment of Network Time" found on our website. Below are the top 20 most common "A Universally Composable Treatment of Network Time".

A  Universally  Composable  Treatment  of  Network  Time

A Universally Composable Treatment of Network Time

... real time is a relatively easy task; indeed, most computing platforms today, even low- end ones, are equipped with a built-in ...on time in a large, asynchronous network like the Internet turns out ... See full document

26

On  Black-Box  Complexity  of  Universally  Composable  Security  in  the  CRS  model

On Black-Box Complexity of Universally Composable Security in the CRS model

... Secure 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 properties. Two of the most important ... See full document

47

Simulatable  Channels:  Extended  Security  that  is  Universally  Composable   and  Easier  to  Prove

Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove

... same time, their composition, in an intermediate step, uses an encryption scheme with full key reveals, such that the problem of key cycles —the environment asking for circular encryptions of a key under that key— ... See full document

34

Universally  Composable  Oblivious  Transfer  Protocol  based  on  the  RLWE  Assumption

Universally Composable Oblivious Transfer Protocol based on the RLWE Assumption

... In real-life, the protocol should be quite efficient. We suggest to use the NIST standard SHA to model random oracles. Regarding encryption, one may use AES (which is also the current NIST standard) instead of the ... See full document

21

A  Simpler  Variant  of  Universally  Composable  Security  for  Standard  Multiparty  Computation

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  secure  TNC  protocol  based  on  IF-T  binding  to  TLS

Universally Composable secure TNC protocol based on IF-T binding to TLS

... the current system. The integrity information is stored in a TPM, which cannot be compromised by a potentially malicious host system. In order to validate the integrity information of an endpoint, the existence and ... See full document

15

Universally  Composable  Secure  Computation  with (Malicious)  Physically  Uncloneable  Functions

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

... achieving universally composable secure computation with ...the treatment of malicious behaviour as general as possible, we allow the adversary to send as PUF any hardware token that meets the ... See full document

53

Fast   and  Universally-Composable  Oblivious  Transfer   and  Commitment  Scheme  with  Adaptive  Security

Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security

... Hardware Details: We have tested the code in a standard LAN network and a simulated WAN setting. Our machine has 8GB RAM and an Intel Core i5-4690 CPU with 3.5 GHz processor speed. For WAN simulation, we used the ... See full document

58

Universally  Composable  Firewall  Architectures  using  Trusted  Hardware

Universally Composable Firewall Architectures using Trusted Hardware

... local-area network (LAN) in which there are only uncompromised ...of network interfaces for input and ...the network interface i ∈ I the packet arrived ... See full document

16

Efficient   and  Universally  Composable  Protocols  for  Oblivious  Transfer  from  the  CDH  Assumption

Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption

... of adaptive corruptions, the simulator learns upon corruption the input of the corrupted party. The simulator must come up with a transcript of the protocol and an internal state of this party such that the transcript ... See full document

23

ROYALE:  A  Framework  for  Universally  Composable  Card  Games  with  Financial  Rewards   and  Penalties  Enforcement

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement

... a treatment of such protocols in the Universal Com- posability (UC) framework, introducing an ideal functionality that captures card games that use a set of core card ... See full document

35

Universally  Composable  Efficient  Priced  Oblivious  Transfer  from  a  Flexible  Membership  Encryption

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption

... under universally composable framework and thus, unlike the existing 1-out-of-n schemes [1], [21] available in the literature, preserves security when it is executed with multiple protocol instances that ... See full document

20

Universally  composable  privacy  preserving  finite  automata  execution  with  low  online   and  offline  complexity

Universally composable privacy preserving finite automata execution with low online and offline complexity

... Finite automata (FA) are among the most often used algorithmic tools for an- alyzing textual data. They are used in filtering spam, recognizing malware, ge- netic analysis, log mining, etc. Often, these applications make ... See full document

16

A sensitivity analysis of the Children's Treatment Network trial: a randomized controlled trial of integrated services versus usual care for children with special health care needs

A sensitivity analysis of the Children's Treatment Network trial: a randomized controlled trial of integrated services versus usual care for children with special health care needs

... short period of observation after the initial launch of the inter- vention. For chronically ill children, the effect of integrated care on health outcomes would often accumulate over time. Thus, an interventional ... See full document

13

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

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

... More recently, [Kol10] implemented string-OT with stateless tamper-proof tokens, but achieved only covert security [AL07]. A unified treatment of tamper-proof hardware assumptions is proposed by [GIS + 10]. ... See full document

58

Challenges for Quality of Service (QoS) in Wireless Sensor Networks

Challenges for Quality of Service (QoS) in Wireless Sensor Networks

... sensor network is a special network with large numbers of nodes consisting embedded processors, sensors, and ...sensor network but real-time communication with the Quality of Service (QoS) ... See full document

6

Universally  Composable  Secure  Computation  with  Corrupted  Tokens

Universally Composable Secure Computation with Corrupted Tokens

... model. However, in our setting, we face a new challenge. Since our final protocol can be executed on polynomially many inputs, where the polynomial is not apriori known to the correlated randomness generator, we must be ... See full document

40

Universally  Composable  Accumulators

Universally Composable Accumulators

... Like [Can04], we discuss several candidate ideal functionalities in order to build up the intuition for how we arrived at the ideal functionality described in Fig. 4 and 5. First Attempt. A naive first attempt at an ... See full document

29

Universally  Composable  Key-Management

Universally Composable Key-Management

... Policies. The goal of key-management is to preserve some kind of policy on a global level. Our policies express two kinds of requirements: usage policies of the form “key A can only be used for tasks X and Y”, and ... See full document

37

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 ... See full document

125

Show all 10000 documents...