Quantum sealed-bid auction using a modified scheme for multiparty circular quantum key agreement

Quantum sealed-bid auction using a modified scheme for multiparty circular quantum key agreement A feasible, secure and collusion attack-free quantum sealed-bid auction protocol is proposed using a modified scheme for multiparty circular quantum key agreement. In the proposed protocol, the set of all (n) bidders is grouped into l subsets (sub-circles) in such a way that only the initiator (who prepares the quantum state to be distributed for a particular round of communication and acts as the receiver in that round) is a member of all the subsets (sub-circles) prepared for a particular round, while any other bidder is part of only a single subset. All n bidders and auctioneer initiate one round of communication, and each of them prepares l copies of a $$\left( r-1\right) $$ r - 1 -partite entangled state (one for each sub-circle), where $$r=\frac{n}{l}+1$$ r = n l + 1 . The efficiency and security of the proposed protocol are critically analyzed. It is shown that the proposed protocol is free from the collusion attacks that are possible on the existing schemes of quantum sealed-bid auction. Further, it is observed that the security against collusion attack increases with the increase in l, but that reduces the complexity (number of entangled qubits in each entangled state) of the entangled states to be used and that makes the scheme scalable and implementable with the available technologies. The additional security and scalability are shown to arise due to the use of a circular structure in place of a complete-graph or tree-type structure used earlier. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Quantum sealed-bid auction using a modified scheme for multiparty circular quantum key agreement

Loading next page...
 
/lp/springer_journal/quantum-sealed-bid-auction-using-a-modified-scheme-for-multiparty-u0YHepzD6R
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-017-1620-0
Publisher site
See Article on Publisher Site

Abstract

A feasible, secure and collusion attack-free quantum sealed-bid auction protocol is proposed using a modified scheme for multiparty circular quantum key agreement. In the proposed protocol, the set of all (n) bidders is grouped into l subsets (sub-circles) in such a way that only the initiator (who prepares the quantum state to be distributed for a particular round of communication and acts as the receiver in that round) is a member of all the subsets (sub-circles) prepared for a particular round, while any other bidder is part of only a single subset. All n bidders and auctioneer initiate one round of communication, and each of them prepares l copies of a $$\left( r-1\right) $$ r - 1 -partite entangled state (one for each sub-circle), where $$r=\frac{n}{l}+1$$ r = n l + 1 . The efficiency and security of the proposed protocol are critically analyzed. It is shown that the proposed protocol is free from the collusion attacks that are possible on the existing schemes of quantum sealed-bid auction. Further, it is observed that the security against collusion attack increases with the increase in l, but that reduces the complexity (number of entangled qubits in each entangled state) of the entangled states to be used and that makes the scheme scalable and implementable with the available technologies. The additional security and scalability are shown to arise due to the use of a circular structure in place of a complete-graph or tree-type structure used earlier.

Journal

Quantum Information ProcessingSpringer Journals

Published: May 22, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off