Article

Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transfer

Authors:

Shin'ichiro Matsuo,

Wakaha OgataAuthors Info & Claims

PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

Page 201

https://doi.org/10.1145/872035.872064

Published: 13 July 2003 Publication History

Get Access

Abstract

No abstract available.

References

[1]

G. Brassard, C. Crépeau, and J.-M. Robert. All-or-nothing disclosure of secrets. Advances in Cryptology - Crypto '86, Lecture Notes in Computer Science, Vol.263, pp.234--238, 1987.

Digital Library

Google Scholar

[2]

S. Matsuo and H. Morita. Secure protocol to construct electronic trading. IEICE Transaction on Fundamentals, E84-A(1):281--288, 2001.

Google Scholar

[3]

S. Matsuo and W. Ogata. Matching oblivious transfer: How to exchange valuable data. IEICE Transaction on Fundamentals, E86-A(1):189--193, 2003.

Google Scholar

Index Terms

Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transfer
1. Security and privacy
2. Social and professional topics
  1. Computing / technology policy
    1. Privacy policies

Recommendations

Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

In this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous Secure Multi-party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n ...
Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing

Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchange protocol would guarantee that, even if one of them maliciously deviates ...
Brief announcement: communication efficient asynchronous byzantine agreement
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

In [7], the authors presented a novel perfect (i.e error-free Asynchronous Verifiable Secret Sharing (AVSS) protocol and using the AVSS, they designed a perfect Asynchronous Multiparty Computation (AMPC) protocol that provides the best known ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

July 2003

380 pages

ISBN:1581137087

DOI:10.1145/872035

General Chair:
Elizabeth Borowsky
Boston Coll.
,
Program Chair:
Sergio Rajsbaum
UNAM

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC03

Sponsor:

PODC03: Twenty-Second Annual ACM Symposium on Principles of Distributed Computing

July 13 - 16, 2003

Massachusetts, Boston

Acceptance Rates

PODC '03 Paper Acceptance Rate 51 of 226 submissions, 23%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
260
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited

Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters

Brief announcement: communication efficient asynchronous byzantine agreement