Secure sealed-bid online auctions using discreet cryptographic proofs
From MaRDI portal
Publication:2450498
DOI10.1016/j.mcm.2011.07.027zbMath1286.94079DBLPjournals/mcm/MontenegroFLP13OpenAlexW2084054030WikidataQ62038151 ScholiaQ62038151MaRDI QIDQ2450498
Javier Lopez, Michael J. Fischer, Jose A. Montenegro, René Peralta
Publication date: 14 May 2014
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.07.027
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Efficient algorithms for computing the Jacobi symbol
- Short non-interactive cryptographic proofs
- Short Discreet Proofs
- A Two-Server, Sealed-Bid Auction Protocol
- Secure Vickrey Auctions without Threshold Trust
- The Knowledge Complexity of Interactive Proof Systems
- A modification of the RSA public-key encryption procedure (Corresp.)
- Cryptanalytic Attacks on Pseudorandom Number Generators
- How to obtain full privacy in auctions
This page was built for publication: Secure sealed-bid online auctions using discreet cryptographic proofs