A privacy-preserving quantum sealed-bid auction protocol with EPR pairs

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Wei Gao ◽  
Run-hua Shi ◽  
Mingxia Wu
Optik ◽  
2021 ◽  
pp. 167039
Author(s):  
Hussein Abulkasim ◽  
Atefeh Mashatan ◽  
Shohini Ghose

2014 ◽  
Vol 61 (6) ◽  
pp. 686-690 ◽  
Author(s):  
Wen-Jie Liu ◽  
Fang Wang ◽  
Sai Ji ◽  
Zhi-Guo Qu ◽  
Xiao-Jun Wang
Keyword(s):  

2021 ◽  
Author(s):  
◽  
Ben Palmer

<p>Suppose you are competing in an online sealed bid auction for some goods. How do you know the auction result can be trusted? The auction site could be performing actions that support its own commercial interests by blocking certain bidders or even reporting incorrect winning prices. This problem is magnified when the auctioneer is an unknown party and the auctions are for high value items. The incentive for the auctioneer to cheat can be high as they could stand to make a significant profit by inflating winning prices or by being paid by a certain bidder to announce them the winner. Verification of auction results provides confidence in the auction result by making it computationally infeasible for an auction participant to cheat and not get caught. This thesis examines the construction of verifiable privacy preserving combinatorial auction protocols. Two verifiable privacy preserving combinatorial auction protocols are produced by extending existing auction protocols.</p>


2020 ◽  
Vol 88 ◽  
pp. 101502 ◽  
Author(s):  
Ramiro Alvarez ◽  
Mehrdad Nojoumian

2021 ◽  
Author(s):  
◽  
Ben Palmer

<p>Suppose you are competing in an online sealed bid auction for some goods. How do you know the auction result can be trusted? The auction site could be performing actions that support its own commercial interests by blocking certain bidders or even reporting incorrect winning prices. This problem is magnified when the auctioneer is an unknown party and the auctions are for high value items. The incentive for the auctioneer to cheat can be high as they could stand to make a significant profit by inflating winning prices or by being paid by a certain bidder to announce them the winner. Verification of auction results provides confidence in the auction result by making it computationally infeasible for an auction participant to cheat and not get caught. This thesis examines the construction of verifiable privacy preserving combinatorial auction protocols. Two verifiable privacy preserving combinatorial auction protocols are produced by extending existing auction protocols.</p>


2012 ◽  
Vol 3 (3) ◽  
pp. 60-61
Author(s):  
V.Sajeev V.Sajeev ◽  
◽  
R.Gowthamani R.Gowthamani

Author(s):  
Haruna HIGO ◽  
Toshiyuki ISSHIKI ◽  
Kengo MORI ◽  
Satoshi OBANA

Sign in / Sign up

Export Citation Format

Share Document