English
Related papers

Related papers: Brandt's Fully Private Auction Protocol Revisited

200 papers

We are interested in the problem of optimal commitments in rank-and-bid based auctions, a general class of auctions that include first price and all-pay auctions as special cases. Our main contribution is a novel approach to solve for…

Computer Science and Game Theory · Computer Science 2015-02-27 Zihe Wang , Pingzhong Tang

Secure E-voting is a challenging protocol. Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature .But most of them need complicated homomorphic encryption which involves complicated…

Cryptography and Security · Computer Science 2016-02-18 V P Binu , Divya G Nair , A Sreekumar

A common practice in many auctions is to offer bidders an opportunity to improve their bids, known as a Best and Final Offer (BAFO) stage. This final bid can depend on new information provided about either the asset or the competitors. This…

Computer Science and Game Theory · Computer Science 2021-04-21 Galit Ashkenazi-Golan , Yevgeny Tsodikovich , Yannick Viossat

We study signaling in Bayesian ad auctions, in which bidders' valuations depend on a random, unknown state of nature. The auction mechanism has complete knowledge of the actual state of nature, and it can send signals to bidders so as to…

Computer Science and Game Theory · Computer Science 2022-01-25 Francesco Bacchiocchi , Matteo Castiglioni , Alberto Marchesi , Giulia Romano , Nicola Gatti

We propose and study a novel mechanism design setup where each bidder holds two kinds of private information: (1) type variable, which can be misreported; (2) information variable, which the bidder may want to conceal or partially reveal,…

Computer Science and Game Theory · Computer Science 2023-01-31 Jibang Wu , Ashwinkumar Badanidiyuru , Haifeng Xu

Privacy-preserving cryptocurrency exchanges (shielded AMMs, batched swap auctions, sealed-bid order-flow auctions) alter what the pricing mechanism observes about order flow. We derive the unique linear Kyle equilibrium when a committed…

Computer Science and Game Theory · Computer Science 2026-05-28 Yuki Nakamura

We propose an efficient protocol for secure comparison of integers when both integers are shared between two parties. Such protocols are useful for implementing secure auctions. The proposed protocol's computational complexity is roughly…

Cryptography and Security · Computer Science 2012-04-16 Rajendra S. Katti , Cristinel Ababei

This paper proposes a privacy protocol for distributed average consensus algorithms on bounded real-valued inputs that guarantees statistical privacy of honest agents' inputs against colluding (passive adversarial) agents, if the set of…

Cryptography and Security · Computer Science 2019-03-25 Nirupam Gupta , Jonathan Katz , Nikhil Chopra

E-commerce, a type of trading that occurs at a high frequency on the Internet, requires guaranteeing the integrity, authentication and non-repudiation of messages through long distance. As current e-commerce schemes are vulnerable to…

Quantum Physics · Physics 2024-01-17 Xiao-Yu Cao , Bing-Hong Li , Yang Wang , Yao Fu , Hua-Lei Yin , Zeng-Bing Chen

This study presents the first semi-quantum private comparison protocol under an almost-dishonest third party. The proposed protocol allows two classical participants to compare their secret information without compromising it's privacy. The…

Quantum Physics · Physics 2016-08-24 Wen-Han Chou , Tzonelih Hwang , Jun Gu

In this work, we study how to securely evaluate the value of trading data without requiring a trusted third party. We focus on the important machine learning task of classification. This leads us to propose a provably secure four-round…

Cryptography and Security · Computer Science 2019-01-04 Vanishree Rao , Yunhui Long , Hoda Eldardiry , Shantanu Rane , Ryan Rossi , Frank Torres

We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…

Computer Science and Game Theory · Computer Science 2009-05-22 Moshe Babaioff , Liad Blumrosen , Aaron L. Roth

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec

A smart grid is an advanced method for supplying electricity to the consumers alleviating the limitations of the existing system. It causes frequent meter reading transmission from the end-user to the supplier. This frequent data…

Cryptography and Security · Computer Science 2020-06-12 Mohammad Saidur Rahman

Collective Investment Algorithms (CoinAlgs) are increasingly popular systems that deploy shared trading strategies for investor communities. Their goal is to democratize sophisticated -- often AI-based -- investing tools. We identify and…

Computer Science and Game Theory · Computer Science 2026-01-05 Andrés Fábrega , James Austgen , Samuel Breckenridge , Jay Yu , Amy Zhao , Sarah Allen , Aditya Saraf , Ari Juels

I establish nonparametric identification results in first- and second-price auctions when transaction prices are truncated by a binding reserve price under a range of information structures. When the number of potential bidders is fixed and…

Econometrics · Economics 2025-10-09 Tonghui Qi

We propose a new three-party quantum private comparison protocol using genuinely maximally entangled six-qubit states. In our protocol, three participants can determine whether their private information are equal or not without an external…

Quantum Physics · Physics 2015-03-17 Cai Zhang , Zhiwei Sun , Xiang Huang , Dongyang Long

We consider the design of private prediction markets, financial markets designed to elicit predictions about uncertain events without revealing too much information about market participants' actions or beliefs. Our goal is to design market…

Computer Science and Game Theory · Computer Science 2016-02-25 Rachel Cummings , David M. Pennock , Jennifer Wortman Vaughan

A powerful feature in mechanism design is the ability to irrevocably commit to the rules of a mechanism. Commitment is achieved by public declaration, which enables players to verify incentive properties in advance and the outcome in…

Theoretical Economics · Economics 2025-07-08 Ran Canetti , Amos Fiat , Yannai A. Gonczarowski

Recently, Chou et al. [Electron Commer Res, DOI 10.1007/s10660-014-9143-6] presented a novel controlled quantum secure direct communication protocol which can be used for online shopping. The authors claimed that their protocol was immune…

Quantum Physics · Physics 2014-10-21 Wei Huang , Ying-Hui Yang , Heng-Yue Jia
‹ Prev 1 4 5 6 7 8 10 Next ›