FAST: fair auctions via secret transactions
From MaRDI portal
Publication:2096643
Recommendations
Cites work
- scientific article; zbMATH DE number 2085425 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 2088334 (Why is no real title available?)
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
- A Two-Server, Sealed-Bid Auction Protocol
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Bit-slice auction circuit
- Can a public blockchain keep a secret?
- Fair and robust multi-party computation using a global transaction ledger
- Fully private auctions in a constant number of rounds
- How to use bitcoin to design fair protocols
- Hybrid consensus: efficient consensus in the permissionless model
- Instantaneous decentralized poker
- Insured MPC: efficient secure computation with financial penalties
- Microeconomic theory
- Minting mechanism for proof of stake blockchains
- Modeling Bitcoin contracts by timed automata
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Privacy-Enhancing Auctions Using Rational Cryptography
- Secure Vickrey auctions without threshold trust
- Secure multi-party computation with identifiable abort
- Security and composition of multiparty cryptographic protocols
Cited in
(3)
This page was built for publication: FAST: fair auctions via secret transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096643)