Secure Vickrey auctions without threshold trust
From MaRDI portal
Publication:2995364
DOI10.1007/3-540-36504-4_7zbMATH Open1275.94032OpenAlexW1858229664MaRDI QIDQ2995364FDOQ2995364
Authors: Helger Lipmaa, N. Asokan, Valtteri Niemi 
Publication date: 20 April 2011
Published in: Financial Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36504-4_7
Recommendations
Auctions, bargaining, bidding and selling, and other market models (91B26) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cited In (20)
- Title not available (Why is that?)
- A secure and efficient protocol for electronic treasury auctions
- Practical Range Proof for Cryptocurrency Monero with Provable Security
- Financial Cryptography
- Secret, verifiable auctions from elections
- Title not available (Why is that?)
- Zero-knowledge range arguments for signed fractional numbers from lattices
- FAST: fair auctions via secret transactions
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- On server trust in private proxy auctions
- Secure generalized Vickrey auction using homomorphic encryption
- Secure sealed-bid online auctions using discreet cryptographic proofs
- Removing the strong RSA assumption from arguments over the integers
- Protocol completion incentive problems in cryptographic Vickrey auctions
- Second price auctions
- How to obtain full privacy in auctions
- Auctions with untrustworthy bidders
- Simulatable adaptive oblivious transfer with statistical receiver's privacy
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
- Trustworthy sealed-bid auction with low communication cost atop blockchain
This page was built for publication: Secure Vickrey auctions without threshold trust
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995364)
