Symbolic Universal Composability [PDF]
2013 IEEE 26th Computer Security Foundations Symposium, 2013 We introduce a variant of the Universal Composability framework (UC; Canetti, FOCS 2001) that uses symbolic cryptography. Two salient properties of the UC framework are secure composition and the possibility of easily defining security by giving an ideal
Dominique Unruh
exaly +7 more sources
On the Composability of Statistically Secure Random Oblivious Transfer [PDF]
Entropy, 2020 We show that random oblivious transfer protocols that are statistically secure according to a definition based on a list of information-theoretical properties are also statistically universally composable.
Rafael Dowsley +2 more
exaly +4 more sources
Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting [PDF]
Entropy, 2021 Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties.
Bruno Costa +4 more
doaj +2 more sources
SSH-DAuth: secret sharing based decentralized OAuth using decentralized identifier [PDF]
Scientific Reports, 2023 OAuth2.0 is a Single Sign-On approach that helps to authorize users to log into multiple applications without re-entering the credentials. Here, the OAuth service provider controls the central repository where data is stored, which may lead to third ...
Danda Prudhvi Krishna +6 more
doaj +2 more sources
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs [PDF]
Journal of Cryptology, 2010 Universal composability and concurrent general composition consider a setting where secure protocols are run concurrently with each other and with arbitrary other possibly insecure protocols.
Yehuda Lindell, Lindell Yehuda
exaly +1 more source
Evaluating Security of Voting Schemes in the Universal Composability Framework [PDF]
Lecture Notes in Computer Science, 2004 Remark. Appears in ACNS 2004, this is the full paper. It contains a proof of Theorem 1, some more details on security against adaptive adversaries in the erasure-free model, and a conclusion.
Jens Groth
exaly +2 more sources
iUC: Flexible Universal Composability Made Simple [PDF]
Lecture Notes in Computer Science, 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.
Ralf Kusters +2 more
exaly +1 more source
Protection Against Subversion Corruptions via Reverse Firewalls in the Plain Universal Composability Framework [PDF]
Lecture Notes in Computer ScienceWhile many modern cryptographic primitives have stood the test of time, attackers started to expand beyond classic cryptanalysis by targeting implementations.
Jorn Müller-Quade +2 more
exaly +4 more sources
Universal composable threshold signature
Tongxin xuebao, 2009 Threshold signature allowed any subset of t parties generating a signature,but that disallowed the creation of a valid signature if fewer than t parties participate in the protocol.Since the security of threshold signature was only con-sidered in a ...
HONG Xuan1, CHEN Ke-fei2, LI Qiang2
doaj +3 more sources
The robust distributed ledger model for a multidimensional blockchain security analysis [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2021 The paper considers the problem of constructing a model of the robust distributed ledger for security proof of a multidimensional blockchain. Several requirements for the model are imposed, among which most important are compatibility with existing ...
Ilya M. Shilov, Danil A. Zakoldaev
doaj +1 more source