A secure and efficient protocol for electronic treasury auctions
From MaRDI portal
Recommendations
Cites work
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Financial Cryptography and Data Security
- Homomorphic encryption and secure comparison
- Multiparty computation, an introduction
- Practical and Secure Solutions for Integer Comparison
- Practical Two-Party Computation Based on the Conditional Gate
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure equality and greater-than tests with sublinear online complexity
- Secure multiparty computation goes live
- Secure Vickrey auctions without threshold trust
- Sub-linear, secure comparison with two non-colluding parties
- Timed release of standard digital signatures (extended abstract)
Cited in
(3)
This page was built for publication: A secure and efficient protocol for electronic treasury auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947111)