Compact multi-party confidential transactions

No Thumbnail Available
File version
Author(s)
Alupotha, J
Boyen, X
Foo, E
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2020
Size
File type(s)
Location

Vienna, Austria

License
Abstract

“Confidential Transactions”, integrated transactions of commitments, signatures, and zero-knowledge range proofs, are favored for their ability to hide transaction amounts. In the real world, multi-party fund transfers are highly desirable for personal and business security. Unfortunately, existing unproven Multi-Party Confidential Transactions are linear in the (exact) number of co-owners; hence they are not compact, very scalable, nor private (leak number of users and their public information). In this study, we provide provably secure private, compact Multi-Party Confidential Transactions, in both the “unanimous” N-out-of-N and “threshold” T-out-of-N settings. Unlike other schemes, our multi-party transactions have the size of single-owner transactions and hide the number of participants. To the best of our knowledge, ours is the first proven secure multi-party and threshold confidential transaction protocol.

Journal Title
Conference Title

Lecture Notes in Computer Science

Book Title
Edition
Volume

12579

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Information and computing sciences

Persistent link to this record
Citation

Alupotha, J; Boyen, X; Foo, E, Compact multi-party confidential transactions, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020, 12579, pp. 430-452