Homomorphic encryption and secure comparison
暂无分享,去创建一个
[1] Jens Groth. A Verifiable Secret Shuffle of Homomorphic Encryptions , 2003, Public Key Cryptography.
[2] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[3] Ian F. Blake,et al. Strong Conditional Oblivious Transfer and Computing on Intervals , 2004, ASIACRYPT.
[4] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[5] Stefan Brands,et al. Rapid Demonstration of Linear Relations Connected by Boolean Operators , 1997, EUROCRYPT.
[6] Juan A. Garay,et al. Practical and Secure Solutions for Integer Comparison , 2007, Public Key Cryptography.
[7] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[8] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[9] Jens Groth,et al. Cryptography in Subgroups of Zn , 2005, TCC.
[10] Marc Fischlin,et al. A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires , 2001, CT-RSA.
[11] Ivan Damgård,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.
[12] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[13] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[14] Ian F. Blake,et al. Conditional Encrypted Mapping and Comparing Encrypted Numbers , 2006, Financial Cryptography.