FAST: fair auctions via secret transactions
From MaRDI portal
Publication:2096643
DOI10.1007/978-3-031-09234-3_36OpenAlexW3169016779MaRDI QIDQ2096643
Bernardo David, Mohsen Pourpouneh, Lorenzo G. C. Gentile
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_36
fairnessauctionscryptographic protocolsmultiparty computationfirst-pricesealed-bidblockchainfinancial cryptographysecond-price
Cryptography (94A60) Auctions, bargaining, bidding and selling, and other market models (91B26) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Instantaneous decentralized poker
- Security and composition of multiparty cryptographic protocols
- Can a public blockchain keep a secret?
- Insured MPC: efficient secure computation with financial penalties
- Minting mechanism for proof of stake blockchains
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Secure Multi-Party Computation with Identifiable Abort
- How to Use Bitcoin to Design Fair Protocols
- A Two-Server, Sealed-Bid Auction Protocol
- Secure Vickrey Auctions without Threshold Trust
- Privacy-Enhancing Auctions Using Rational Cryptography
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
- Bit-Slice Auction Circuit
- Modeling Bitcoin Contracts by Timed Automata
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Computer Aided Verification
This page was built for publication: FAST: fair auctions via secret transactions
