Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the Structure of Unconditional UC Hybrid Protocols

Mike Rosulek, Morgan Shirley

Published Jan 1, 2018• 1 citation
Publisher
DOI
10.1007/978-3-030-03810-6_4

Related papers

Multi-Protocol UC and its Use for Building Modular and Efficient Protocols.

Jan L. Camenisch, Manu Drijvers, Björn Tackmann

•Jan 1, 2019•7 citations

On the Structure of Unconditional UC Hybrid Protocols.

Mike Rosulek, Morgan Shirley

We study the problem of secure two-party computation in the presence of a trusted setup. If there is an unconditionally UC-secure protocol for f that makes use of calls to an ideal g, then we say that f reduces to g (and write \(f \sqsubseteq g\)). Some g are complete in the sense that all functions reduce to g. However, almost nothing is known about the power of an incomplete g in this setting. We shed light on this gap by showing a characterization of \(f \sqsubseteq g\) for incomplete g.

•Jan 1, 2017•0 citations

On Adaptively Secure Protocols

Muthuramakrishnan Venkitasubramaniam

Lecture notes in computer science•Jan 1, 2014•13 citations

Ideal Functionality and Sequential Composition of Zero-knowledge

Dai Yiqi

UC security is the framework in treating a stand-alone protocol and guaranteeing the secure composition.This means that a protocol may run concurrently with many other protocols,on arbitrary inputs and in adversarial controlled way,if it is UC security in the sense that it emulates an ideal functionality,it can be treated as a piece of that ideal functionality in overall system security analysis.In this paper,ZK under UC framework is studied,and the study proves that Blum protocol is closed under sequential composition in the Fwzk-hybrid model.

Information Security and Communications Privacy•Jan 1, 2012•0 citations

A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models

Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam

Lecture notes in computer science•Jan 1, 2017•3 citations

Reducibility Among Protocols

Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani

Springer eBooks•Jan 1, 1984•9 citations
We study the problem of secure two-party computation in the presence of a trusted setup. If there is an unconditionally UC-secure protocol for f that makes use of calls to an ideal g, then we say that f reduces to g (and write f⊑gf \sqsubseteq gf⊑g). Some g are complete in the sense that all functions reduce to g. However, almost nothing is known about the power of an incomplete g in this setting. We shed light on this gap by showing a characterization of f⊑gf \sqsubseteq gf⊑g for incomplete g.
UC security is the framework in treating a stand-alone protocol and guaranteeing the secure composition.This means that a protocol may run concurrently with many other protocols,on arbitrary inputs and in adversarial controlled way,if it is UC security in the sense that it emulates an ideal functionality,it can be treated as a piece of that ideal functionality in overall system security analysis.In this paper,ZK under UC framework is studied,and the study proves that Blum protocol is closed under sequential composition in the Fwzk-hybrid model.