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

Springer eBooks

Secure Protocols with Asymmetric Trust

Ivan Damgård, Yvo Desmedt, Matthias Fitzi, Jesper Buus Nielsen

Published Nov 4, 2007• 31 citations
Publisher
DOI
10.1007/978-3-540-76900-2_22

Related papers

Security of cryptographic protocols based on the trusted party

裕治 渡邊

•Jan 1, 2001•0 citations

Secure Guaranteed Computation.

Amir Herzberg, Haya Shulman

We introduce secure guaranteed two-party computation, where parties commit in advance to compute a function over their private inputs, by providing some (validated) compensation, such that if a party fails to provide an appropriate input during protocol execution, then the peer receives the compensation. Enforcement of the guarantees requires a trusted enforcement authority (TEA); however, the protocol protects con dentiality even from the TEA. Our secure guaranteed computation protocol is optimistic, i.e., the TEA is involved only if a party fails to participate (correctly). Secure guaranteed computation has direct practical applications, such as sensitive trading of nancial products, and could also be used as a building block to motivate parties to complete protocols, e.g., ensuring unbiased coin tossing. The guarantee process can be either symmetric (both parties provide guarantees) or asymmetric (e.g., only server provides guarantee to client). Symmetric guarantees should also be fair, i.e., one party cannot obtain guarantee of the other party without supplying a guarantee as well. The protocol guaranteeing output, which we present uses in a modular manner a new protocol, that we construct, for optimistic fair secure computation, which may be of independent interest, as it is simpler and more e cient than previously known protocols.

•Jan 1, 2010•10 citations

On Adaptively Secure Protocols

Muthuramakrishnan Venkitasubramaniam

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

Secure protocols and their applications

P.M.T.B Sandirigama

•Jan 1, 2001•0 citations

Authenticated Asymmetric Group Key Agreement Protocol and Its Application

L. Zhang, Qianhong Wu, B. Qin

A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the group. The existing instantiation is only secure against passive adversaries. In this paper, we first propose an authenticated asymmetric group key agreement protocol which captures the practical security properties against active attacks. Based on our protocol, we then propose a broadcast encryption system without relying on a trusted dealer to distribute the secret keys to the users. Our system has also short ciphertexts. Furthermore, the proposal is equipped with the perfect forward security property.

International Conference on Communications•May 1, 2010•12 citations

Secure Proof in Non-Asymmetric Trusted Execution Environments (ASEE) Based on Quantum Key Distribution

Jincheng Zhang

This paper proposes a novel approach to security proof within Non-Asymmetric Trusted Execution Environments (ASEE) leveraging Quantum Key Distribution (QKD). The core challenge in ASEE design is establishing trust in the execution of code, often relying on a central trusted party. We introduce a mechanism that utilizes QKD to generate a shared key, which is then employed to securely encrypt the quantum state representing the execution process of the code. Post-execution verification confirms the correctness of the results, followed by decryption using the same key. This process creates a fundamentally verifiable trust foundation, directly addressing the trust issues inherent in traditional ASEE models. The method offers a robust defense against potential attacks by providing a complete audit trail of the code's execution through the quantum key distribution process. We demonstrate the feasibility and potential security advantages of this approach.

•Aug 31, 2026•0 citations
We introduce secure guaranteed two-party computation, where parties commit in advance to compute a function over their private inputs, by providing some (validated) compensation, such that if a party fails to provide an appropriate input during protocol execution, then the peer receives the compensation. Enforcement of the guarantees requires a trusted enforcement authority (TEA); however, the protocol protects con dentiality even from the TEA. Our secure guaranteed computation protocol is optimistic, i.e., the TEA is involved only if a party fails to participate (correctly). Secure guaranteed computation has direct practical applications, such as sensitive trading of nancial products, and could also be used as a building block to motivate parties to complete protocols, e.g., ensuring unbiased coin tossing. The guarantee process can be either symmetric (both parties provide guarantees) or asymmetric (e.g., only server provides guarantee to client). Symmetric guarantees should also be fair, i.e., one party cannot obtain guarantee of the other party without supplying a guarantee as well. The protocol guaranteeing output, which we present uses in a modular manner a new protocol, that we construct, for optimistic fair secure computation, which may be of independent interest, as it is simpler and more e cient than previously known protocols.
A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the group. The existing instantiation is only secure against passive adversaries. In this paper, we first propose an authenticated asymmetric group key agreement protocol which captures the practical security properties against active attacks. Based on our protocol, we then propose a broadcast encryption system without relying on a trusted dealer to distribute the secret keys to the users. Our system has also short ciphertexts. Furthermore, the proposal is equipped with the perfect forward security property.
This paper proposes a novel approach to security proof within Non-Asymmetric Trusted Execution Environments (ASEE) leveraging Quantum Key Distribution (QKD). The core challenge in ASEE design is establishing trust in the execution of code, often relying on a central trusted party. We introduce a mechanism that utilizes QKD to generate a shared key, which is then employed to securely encrypt the quantum state representing the execution process of the code. Post-execution verification confirms the correctness of the results, followed by decryption using the same key. This process creates a fundamentally verifiable trust foundation, directly addressing the trust issues inherent in traditional ASEE models. The method offers a robust defense against potential attacks by providing a complete audit trail of the code's execution through the quantum key distribution process. We demonstrate the feasibility and potential security advantages of this approach.