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

Fair and Robust Multi-party Computation Using a Global Transaction Ledger

Aggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas

Published Jan 1, 2016• 136 citations
Publisher
DOI
10.1007/978-3-662-49896-5_25

Related papers

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Handan Kılınç, Alptekın Küpçü

Lecture notes in computer science•Jan 1, 2015•25 citations

Secure Multi-party Computation with Legally-Enforceable Fairness

Takeshi Nakai, Kazumasa Shinagawa

Lecture notes in computer science•Jan 1, 2023•2 citations

Complete Fairness in Multi-party Computation without an Honest Majority

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2009•53 citations

The Quantum Countdown: Quantum Computing & The Future Of Smart Ledger Encryption

Maury Shenk

Long Finance's Distributed Futures research programme is pleased to announce the launch the report “The Quantum Countdown: Quantum Computing & The Future Of Distributed Ledger Encryption”, another in a series of exciting projects in the programme. Smart Ledgers are based on a combination of mutual distributed ledgers (aka block-chain: multi-organisational databases with a super audit trail) with embedded programming and sensing, thus permitting semi-intelligent, autonomous transactions. Smart Ledgers are touted as a technology for fair play in a globalized world. There are numerous projects building trade systems using this technology with announcements from governments, shipping firms, large IT firms, and the like. The research is intended to inform policy makers and business people making decisions about moving towards these systems. This report is about a major threat to the security of Smart Ledgers and other systems from quantum computing. If and when large-scale quantum computers become available, there is a concern that such computers would be able to break the security of widely-used public key cryptography, which allows remote parties to communicate securely and authenticate transactions and data without sharing a secret key in advance. Fortunately, there are good solutions to this problem, and better ones are emerging. The hard questions for individual computer system operators involve when and how to address the problem, given its uncertain timing and the evolving solutions. The report seeks to explain the problem in detail for both non-technical and technical readers, starting with the essentials of cryptography, quantum computing, and how quantum computing threatens public key cryptography. It then considers the available solutions to the problem, and provides frameworks for deciding when and how to respond to it.

•Feb 1, 2018•1 citation

Efficiently Making Secure Two-Party Computation Fair

Handan Kılınç, Alptekın Küpçü

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

A traceable optimistic fair exchange protocol

Ramin Ganjavi, Maryam Rajabzadeh Asaar, Mahmoud Salmasizadeh

An Optimistic fair exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol, both of them receive their items or none of them receives anything. In 2008, Huang et al. presented an efficient OFE protocol, but there is a security problem in their scheme. If the trusted third party (TTP) is dishonest and colludes with the verifier, the TTP can complete the transaction without getting signer's agreement. To solve this problem, we propose an OFE protocol in which there is a tracing algorithm to detect the party who completes the transaction. Furthermore, we obtain the accountability property introduced by Huang et al. in 2011, more efficiently and in the standard model while their protocol is in the random oracle model. We prove the security of our scheme under the chosen-key model and multi-user setting in the standard model.

International ISC Conference on Information Security and Cryptology (ISCISC)•Sep 1, 2014•2 citations
Long Finance's Distributed Futures research programme is pleased to announce the launch the report “The Quantum Countdown: Quantum Computing & The Future Of Distributed Ledger Encryption”, another in a series of exciting projects in the programme. Smart Ledgers are based on a combination of mutual distributed ledgers (aka block-chain: multi-organisational databases with a super audit trail) with embedded programming and sensing, thus permitting semi-intelligent, autonomous transactions. Smart Ledgers are touted as a technology for fair play in a globalized world. There are numerous projects building trade systems using this technology with announcements from governments, shipping firms, large IT firms, and the like. The research is intended to inform policy makers and business people making decisions about moving towards these systems. This report is about a major threat to the security of Smart Ledgers and other systems from quantum computing. If and when large-scale quantum computers become available, there is a concern that such computers would be able to break the security of widely-used public key cryptography, which allows remote parties to communicate securely and authenticate transactions and data without sharing a secret key in advance. Fortunately, there are good solutions to this problem, and better ones are emerging. The hard questions for individual computer system operators involve when and how to address the problem, given its uncertain timing and the evolving solutions. The report seeks to explain the problem in detail for both non-technical and technical readers, starting with the essentials of cryptography, quantum computing, and how quantum computing threatens public key cryptography. It then considers the available solutions to the problem, and provides frameworks for deciding when and how to respond to it.
An Optimistic fair exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol, both of them receive their items or none of them receives anything. In 2008, Huang et al. presented an efficient OFE protocol, but there is a security problem in their scheme. If the trusted third party (TTP) is dishonest and colludes with the verifier, the TTP can complete the transaction without getting signer's agreement. To solve this problem, we propose an OFE protocol in which there is a tracing algorithm to detect the party who completes the transaction. Furthermore, we obtain the accountability property introduced by Huang et al. in 2011, more efficiently and in the standard model while their protocol is in the random oracle model. We prove the security of our scheme under the chosen-key model and multi-user setting in the standard model.