A Secure and Efficient Protocol for Electronic Treasury Auctions

DOI10.1007/978-3-319-21356-9_9zbMath1401.94138OpenAlexW2258048085MaRDI QIDQ2947111

Osmanbey Uzunkol, Atilla Bektaş, Mehmet Sabır Kiraz

Publication date: 21 September 2015

Published in: Cryptography and Information Security in the Balkans (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21356-9_9

zbMATH Keywords

privacyconfidentialitysecure multi-party computationtreasury auctionsthreshold homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Homomorphic encryption and secure comparison
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
• Secure Vickrey Auctions without Threshold Trust
• Timed Release of Standard Digital Signatures
• Sub-linear, Secure Comparison with Two Non-colluding Parties
• Secure Multiparty Computation Goes Live
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure Equality and Greater-Than Tests with Sublinear Online Complexity
• Practical Two-Party Computation Based on the Conditional Gate
• Financial Cryptography and Data Security
• Practical and Secure Solutions for Integer Comparison

This page was built for publication: A Secure and Efficient Protocol for Electronic Treasury Auctions