Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption
暂无分享,去创建一个
[1] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[2] Tatsuaki Okamoto,et al. A New Public-Key Cryptosystem as Secure as Factoring , 1998, EUROCRYPT.
[3] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[4] Kaoru Kurosawa,et al. Efficient Anonymous Channel and All/Nothing Election Scheme , 1994, EUROCRYPT.
[5] Markus Jakobsson,et al. Mix and Match: Secure Function Evaluation via Ciphertexts (Extended Abstract) , 2000 .
[6] Ari Juels,et al. A Two-Server, Sealed-Bid Auction Protocol , 2002, Financial Cryptography.
[7] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.
[8] Kaoru Kurosawa,et al. Bit-Slice Auction Circuit , 2002, ESORICS.
[9] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[10] Masayuki Abe,et al. M+1-st Price Auction Using Homomorphic Encryption , 2002, Public Key Cryptography.
[11] Matthew K. Franklin,et al. The Design and Implementation of a Secure Auction Service , 1996, IEEE Trans. Software Eng..
[12] Paulo S. L. M. Barreto,et al. Hardware accelerators for pairing based cryptosystems , 2005 .
[13] Markus Jakobsson,et al. Mix and Match: Secure Function Evaluation via Ciphertexts , 2000, ASIACRYPT.
[14] Matthew K. Franklin,et al. Efficient generation of shared RSA keys , 2001, JACM.
[15] Valtteri Niemi,et al. Secure Vickrey Auctions without Threshold Trust , 2002, Financial Cryptography.