Results 51 to 60 of about 3,675 (190)
iUC: Flexible Universal Composability Made Simple [PDF]
, 2019 Proving the security of complex protocols is a crucial and very challenging task. A widely used approach for reasoning about such protocols in a modular way is universal composability.
Daniel Rausch +3 more
core +1 more source
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
Resource Fairness and Composability of Cryptographic Protocols [PDF]
, 2005 We introduce the notion of resource-fair protocols. Informally, this property states that if one party learns the output of the protocol, then so can all other parties, as long as they expend roughly the same amount of resources.
Manoj Prabhakaran +5 more
core +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
Constructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing
EURASIP Journal on Wireless Communications and Networking, 2008 Group key exchange (GKE) is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group ...
Moon Sangjae +3 more
doaj +2 more sources
IEEE Access, 2020 This paper presents a case study that demonstrates how tools from compositional verification can be used to design and analyze complex multi-agent systems operating in dynamic and uncertain environments.
Devaprakash Muniraj +2 more
doaj +1 more source
Composability Concept for Dependable Embedded Systems
, 2013 Composability is a sought after property. However, whereas there is usually an intuitive understanding of this concept, a clear definition has been frequently missing. In this paper, we refine our concept of composability given in.
Werner, Matthias +3 more
core +1 more source
Characters and transfer maps via categorified traces
Forum of Mathematics, SigmaWe develop a theory of generalized characters of local systems in $\infty $ -categories, which extends classical character theory for group representations and, in particular, the induced character formula.
Shachar Carmeli +3 more
doaj +1 more source
A Composability-Based Transformer Pruning Framework
, 2023 This thesis addresses the crucial issue of deploying large Transformer models on resource-constrained edge devices. Given the slow training speeds, the current Transformer pruning and fine-tuning process becomes tedious and time-consuming for multiple ...
Lin, Yuping
core +1 more source
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