中文
相关论文

相关论文: PS-TRUST: Provably Secure Solution for Truthful Do…

200 篇论文

We revisit the well-studied problem of budget-feasible procurement, where a buyer with a strict budget constraint seeks to acquire services from a group of strategic providers (the sellers). During the last decade, several strategyproof…

计算机科学与博弈论 · 计算机科学 2021-07-22 Eric Balkanski , Pranav Garimidi , Vasilis Gkatzelis , Daniel Schoepflin , Xizhi Tan

Traditionally, threshold secret sharing (TSS) schemes assume all parties have equal weight, yet emerging systems like blockchains reveal disparities in party trustworthiness, such as stake or reputation. Weighted Secret Sharing (WSS)…

密码学与安全 · 计算机科学 2025-06-02 Kareem Shehata , Han Fangqi , Sri AravindaKrishnan Thyagarajan

Existing auction mechanisms are vulnerable to bidder collusion, which substantially degrades revenue and non-colluder welfare. To design truthful mechanisms resilient to collusion, we introduce a novel approach that leverages a machine…

计算机科学与博弈论 · 计算机科学 2026-05-11 Sukanya Kudva , Edward Dowling , Anil Aswani

As computational agents are developed for increasingly complicated e-commerce applications, the complexity of the decisions they face demands advances in artificial intelligence techniques. For example, an agent representing a seller in an…

人工智能 · 计算机科学 2017-01-08 W. P. Birmingham , E. H. Durfee , S. Park

In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the page. This gives rise to a bipartite matching market that is…

计算机科学与博弈论 · 计算机科学 2008-07-09 Gagan Aggarwal , S. Muthukrishnan , David Pal , Martin Pal

It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true: creating a randomized truthful mechanism is essentially as easy as a…

计算机科学与博弈论 · 计算机科学 2015-11-17 Moshe Babaioff , Robert D. Kleinberg , Aleksandrs Slivkins

Classic results show that even an arbitrarily small correlation across bidders' information can enable full surplus extraction in auctions and related mechanism design settings. Motivated by this fragility, we study the information…

计算机科学与博弈论 · 计算机科学 2026-04-28 Boyu Liu , Wei Tang , Zihe Wang , Shuo Zhang

The wide deployment of tokens for digital assets on top of Ethereum implies the need for powerful trading platforms. Vickrey auctions have been known to determine the real market price of items as bidders are motivated to submit their own…

密码学与安全 · 计算机科学 2019-05-16 Hisham S. Galal , Amr M. Youssef

The precise design of a system may be considered a trade secret which should be protected, whilst at the same time component manufacturers are sometimes reluctant to release full test data (perhaps only providing mean time to failure data).…

密码学与安全 · 计算机科学 2016-04-19 Louis J. M. Aslett

Differential Privacy (DP) provides an elegant mathematical framework for defining a provable disclosure risk in the presence of arbitrary adversaries; it guarantees that whether an individual is in a database or not, the results of a DP…

密码学与安全 · 计算机科学 2021-08-19 Aleksandra Slavkovic , Roberto Molinari

This paper propose a protocol for lottery and a protocol for auction on quantum Blockchain. Our protocol of lottery satisfies randomness, unpredictability, unforgeability, verifiability, decentralization and unconditional security. Our…

密码学与安全 · 计算机科学 2020-04-23 Xin Sun , Piotr Kulicki , Mirek Sopek

With the rapidly growing demand for the cloud services, a need for efficient methods to trade computing resources increases. Commonly used fixed-price model is not always the best approach for trading cloud resources, because of its…

计算机科学与博弈论 · 计算机科学 2014-02-03 Sergei Chichin , Quoc Bao Vo , Ryszard Kowalczyk

To support a freight carrier in a combinatorial transport auction, we proposes an exact and two heuristic strategies for bidding on subsets of requests. The exact bidding strategy is based on the concept of elementary request combinations.…

计算机科学与博弈论 · 计算机科学 2014-06-10 Tobias Buer

We provide a Polynomial Time Approximation Scheme (PTAS) for the Bayesian optimal multi-item multi-bidder auction problem under two conditions. First, bidders are independent, have additive valuations and are from the same population.…

计算机科学与博弈论 · 计算机科学 2012-11-06 Yang Cai , Zhiyi Huang

In two-sided markets, Myerson and Satterthwaite's impossibility theorem states that one can not maximize the gain-from-trade while also satisfying truthfulness, individual-rationality and no deficit. Attempts have been made to circumvent…

计算机科学与博弈论 · 计算机科学 2019-12-10 Rica Gonen , Erel Segal-Halevi

The Ethereum blockchain as a decentralized platform is so successful that many applications deployed on it. However, for the inherent transparency properties and the lack of privacy, deploying a financial application on top of it is always…

密码学与安全 · 计算机科学 2019-04-16 Jie Xiong , Qi Wang

The consensus protocol is a critical component of distributed ledgers and blockchains. Achieving consensus over a decentralized network poses challenges to transaction finality and performance. Currently, the highest-performing consensus…

密码学与安全 · 计算机科学 2024-08-09 Pascal Berrang , Inês Cruz , Bruno França , Philipp von Styp-Rekowsky , Marvin Wissfeld

We present a novel method for a multi-party, zero-trust validator infrastructure deployment arrangement via smart contracts to secure Proof-of-Stake (PoS) blockchains. The proposed arrangement architecture employs a combination of…

密码学与安全 · 计算机科学 2023-08-03 Scott Seidenberger , Alec Sokol , Anindya Maiti

The massive integration of uncertain distributed renewable energy resources into power systems raises power imbalance concerns. Peer-to-peer (P2P) energy trading provides a promising way to balance the prosumers' volatile energy power…

系统与控制 · 电气工程与系统科学 2025-05-28 Junhong Liu , Qinfei Long , Rong-Peng Liu , Wenjie Liu , Xin Cui , Yunhe Hou

A feasible, secure and collusion-attack-free quantum sealed-bid auction protocol is proposed using a modified scheme for multi-party circular quantum key agreement. In the proposed protocol, the set of all ($n$) bidders is grouped in to $l$…

量子物理 · 物理学 2022-06-10 Rishi Dutt Sharma , Kishore Thapliyal , Anirban Pathak