Results 11 to 20 of about 816 (272)
Algebraic Adversaries in the Universal Composability Framework [PDF]
, 2021 The 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
Barbosa, Manuel +4 more
core +9 more sources
Universal Composability is Secure Compilation
CoRR, 2020 Universal composability is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: UC protocols are secure even when composed with other protocols.
Robert Künnemann (17287756) +2 more
core +3 more sources
Long-term Security and Universal Composability [PDF]
Journal of Cryptology, 2010 Algorithmic progress and future technological advances threaten today\u27s cryptographic protocols. This may allow adversaries to break a protocol retrospectively by breaking the underlying complexity assumptions long after the execution of the protocol.
Müller-Quade, Jörn +3 more
core +5 more sources
Simplified Universal Composability Framework
, 2015 We introduce a simplified universally composable (UC) security framework in our thesis (2005). In this paper we present an updated more comprehensive and illustrated version.
Wikström, Douglas,, Douglas Wikström
core +2 more sources
Multiverse of HawkNess: A Universally-Composable MPC-Based Hawk Variant
Cryptography, 2022 The evolution of smart contracts in recent years inspired a crucial question: do smart contract evaluation protocols provide the required level of privacy when executing contracts on the blockchain? The Hawk (IEEE S&P ’16) paper introduces a way to solve
Aritra Banerjee, Hitesh Tewari
doaj +1 more source
Towards Quantum One-Time Memories from Stateless Hardware [PDF]
Quantum, 2021 A central tenet of theoretical cryptography is the study of the minimal assumptions required to implement a given cryptographic primitive. One such primitive is the one-time memory (OTM), introduced by Goldwasser, Kalai, and Rothblum [CRYPTO 2008], which
Anne Broadbent +2 more
doaj +1 more source
Origami Store: UC-Secure Foldable Datachains for the Quantum Era
IEEE Access, 2021 Traditional blockchains preserve everything, if verification is to avoid trusted third parties. The accumulation of outdated but undeletable data makes traditional blockchains non-scalable for practical applications.
Jayamine Alupotha, Xavier Boyen
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
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