Results 11 to 20 of about 959,083 (268)
Algebraic Adversaries in the Universal Composability Framework [PDF]
, 2021 he algebraic-group model (AGM), which lies between the generic group model and the standard model of computation, provides a means by which to analyze the security of cryptosystems against so-called algebraic adversaries. We formalize the AGM within the framework of universal com- posability, providing formal definitions for this setting and proving an
Abdalla, Michel +4 more
core +12 more sources
Fair and Secure Multi-Party Computation with Cheater Detection
Cryptography, 2021 Secure multi-party computation (SMC) is a cryptographic protocol that allows participants to compute the desired output without revealing their inputs. A variety of results related to increasing the efficiency of SMC protocol have been reported, and thus,
Minhye Seo
doaj +1 more source
Foundations of Programmable Secure Computation
Cryptography, 2021 This paper formalises the security of programmable secure computation focusing on simplifying security proofs of new algorithms for existing computation frameworks.
Sven Laur, Pille Pullonen-Raudvere
doaj +1 more source
The IITM model : a simple and expressive model for universal composability [PDF]
, 2023 The universal composability paradigm allows for the modular design and analysis of cryptographic protocols. It has been widely and successfully used in cryptography. However, devising a coherent yet simple and expressive model for universal composability
Küsters, Ralf +2 more
core +1 more source
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 +5 more sources
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 +3 more sources
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 +3 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 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