An efficient and probabilistic secure bit-decomposition

ASIA CCS 2013 - Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security

Volumn , Issue , 2013, Pages 541-546

  Samanthula, Bharath K K ^a   Chun, Hu ^a   Jiang, Wei ^a  

^a Missouri University of Science and Technology   (United States)

Author keywords

bit decomposition; encryption; security

Indexed keywords

BIT-DECOMPOSITION; COMPUTATION TIME; DOMAIN SIZE; HIGH PROBABILITY; HOMOMORPHIC ENCRYPTION SCHEMES; SECURE MULTI-PARTY COMPUTATION; SECURITY; SECURITY DEFINITIONS;

CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 84877991754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484313.2484386     Document Type: Conference Paper

References (18)

1. J. Algesheimer, J. Camenisch, and V. Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In CRYPTO, pages 417-432. Springer-Verlag, 2002.
2. I. F. Blake and V. Kolesnikov. One-round secure comparison of integers. Journal of Mathematical Cryptology, 3(1):37-68, May 2009.
3. R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In EUROCRYPT, pages 280-299. Springer-Verlag, 2001.
4. I. Damgård, M. Fitzi, E. Kiltz, J. B. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In Theory of Cryptography Conference (TCC), volume 3876, pages 285-304. Springer, 2006.
5. M. Fischlin. A cost-effective pay-per-multiplication comparison method for millionaires. In Proceedings of the Conference on Topics in Cryptology: The Cryptographer's Track at RSA, pages 457-472. Springer-Verlag, 2001.
6. O. Goldreich. The Foundations of Cryptography, volume 2. Cambridge University Press, 2004.
7. J. Guajardo, B. Mennink, and B. Schoenmakers. Modulo reduction for paillier encryptions and application to secure statistical analysis. In Financial Cryptography and Data Security, volume 6052, pages 375-382. Springer, 2010.
8. A. E. Nergiz, M. E. Nergiz, T. Pedersen, and C. Clifton. Practical and secure integer comparison and interval check. In Proceedings of Second International Conference on Social Computing, pages 791-799. IEEE Computer Society, 2010.
9. C. Ning and Q. Xu. Constant-rounds, linear multi-party computation for exponentiation and modulo reduction with perfect security. In ASIACRYPT, volume 7073 of LNCS, pages 572-589. Springer, 2011.
10. R. Nisbet, J. Elder, and G. Miner. Handbook of Statistical Analysis and Data Mining Applications. Academic Press, 2009.
11. T. Nishide and K. Ohta. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In PKC, pages 343-360. Springer-Verlag, 2007.
12. P. Paillier. Public key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - Eurocrypt '99, pages 223-238. Springer-Verlag, 1999.
13. T. Reistad and T. Toft. Linear, constant-rounds bit-decomposition. In ICISC, pages 245-257. Springer-Verlag, 2010.
14. B. Schoenmakers and P. Tuyls. Efficient binary conversion for paillier encrypted values. In EUROCRYPT, pages 522-537. Springer-Verlag, 2006.
15. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, nov 1979.
16. T. Toft. Constant-rounds, almost-linear bit-decomposition of secret shared values. In Proceedings of the The Cryptographers' Track at the RSA Conference on Topics in Cryptology, pages 357-371. Springer-Verlag, 2009.
17. A. C. Yao. Protocols for secure computations. In Symposium on Foundations of Computer Science, pages 160-164, Washington, DC, USA, 1982. IEEE Computer Society.
18. A. C. Yao. How to generate and exchange secrets. In Symposium on Foundations of Computer Science, pages 162-167. IEEE Computer Society, 1986.