Results 21 to 30 of about 816 (272)
ROTed: Random Oblivious Transfer for embedded devices
Transactions on Cryptographic Hardware and Embedded Systems, 2021 Oblivious Transfer (OT) is a fundamental primitive in cryptography, supporting protocols such as Multi-Party Computation and Private Set Intersection (PSI), that are used in applications like contact discovery, remote diagnosis and contact tracing.
P. Branco +5 more
doaj +1 more source
Universally Composable Auditable Surveillance
, 2023 peer ...
Valerie Fetzer +4 more
openaire +4 more sources
AGATE: Augmented Global Attested Trusted Execution in the Universal Composability Framework [PDF]
A Trusted Execution Environment (TEE) is a security technology, implemented by CPU manufacturers, which guarantees integrity and confidentiality on a restricted execution environment to any remote verifier through attestation.
Markulf Kohlweiss, Lorenzo Martinico
exaly +1 more source
Simple and flexible universal composability : definition of a framework and applications [PDF]
, 2020 Security protocols, such as TLS, SSH, IEEE~802.11, and DNSSEC, have become crucial tools in modern society to protect people, data, and infrastructure.
Rausch, Daniel
core +1 more source
Universally Composable Commitments [PDF]
, 2001 We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an "ideal commitment service," even when concurrently composed with an arbitrary set of protocols.
Canetti, Ran, Fischlin, Marc
openaire +2 more sources
Oblivious Transfer Based on NTRUEncrypt
IEEE Access, 2018 Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract.
Bo Mi +4 more
doaj +1 more source
Universally Composable Incoercibility [PDF]
, 2010 We present the UC/c framework, a general definition for secure and incoercible multi-party protocols. Our framework allows to model arbitrary reactive protocol tasks (by specifying an ideal functionality) and comes with a universal composition theorem.
Dominique Unruh, Jörn Müller-Quade
openaire +2 more sources
Universally Composable Synchronous Computation [PDF]
, 2013 In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: they can simultaneously achieve input completeness (all honest parties' inputs are included in the computation) and guaranteed termination (honest parties do not 'hang' indefinitely).
Katz Jonathan +3 more
openaire +2 more sources
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability [PDF]
, 2021 International audienceIn this paper we enhance the EasyCrypt proof assistant to reason about computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls ...
Barbosa, Manuel +9 more
core +1 more source
Universally Composable Oblivious Transfer with Low Communication
Applied Sciences, 2023 In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communication is built. This protocol obtained full simulation security based on the modulo learning with rounding (Mod-LWR) assumption.
Jiashuo Song +5 more
doaj +1 more source