Client-Aided Two-Party Secure Interval Test Protocol
暂无分享,去创建一个
[1] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[2] Eike Kiltz,et al. Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation , 2006, IACR Cryptol. ePrint Arch..
[3] Jacob C. N. Schuldt,et al. A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions , 2017, 2017 15th Annual Conference on Privacy, Security and Trust (PST).
[4] Thijs Veugen,et al. Encrypted integer division and secure comparison , 2014, Int. J. Appl. Cryptogr..
[5] Chris Clifton,et al. Practical and Secure Integer Comparison and Interval Check , 2010, 2010 IEEE Second International Conference on Social Computing.
[6] Juan A. Garay,et al. Practical and Secure Solutions for Integer Comparison , 2007, Public Key Cryptography.
[7] Kazuo Ohta,et al. Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol , 2007, Public Key Cryptography.
[8] Ivan Damgård,et al. A correction to 'efficient and secure comparison for on-line auctions' , 2009, Int. J. Appl. Cryptogr..
[9] Donald Beaver,et al. Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.
[10] Zekeriya Erkin,et al. Secure Comparison Protocols in the Semi-Honest Model , 2015, IEEE Journal of Selected Topics in Signal Processing.
[11] Ian F. Blake,et al. Conditional Encrypted Mapping and Comparing Encrypted Numbers , 2006, Financial Cryptography.
[12] Payman Mohassel,et al. SecureML: A System for Scalable Privacy-Preserving Machine Learning , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[13] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[14] Ian F. Blake,et al. Strong Conditional Oblivious Transfer and Computing on Intervals , 2004, ASIACRYPT.
[15] Koji Nuida,et al. Constant-Round Client-Aided Secure Comparison Protocol , 2018, ESORICS.
[16] Pim Tuyls,et al. Practical Two-Party Computation Based on the Conditional Gate , 2004, ASIACRYPT.
[17] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[18] Ivan Damgård,et al. Homomorphic encryption and secure comparison , 2008, Int. J. Appl. Cryptogr..
[19] Yehuda Lindell,et al. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority , 2016, IACR Cryptol. ePrint Arch..
[20] Octavian Catrina,et al. Improved Primitives for Secure Multiparty Integer Computation , 2010, SCN.
[21] Silvio Micali,et al. How to play any mental game, or a completeness theorem for protocols with honest majority , 2019, Providing Sound Foundations for Cryptography.