Constant-rounds, almost-linear bit-decomposition of secret shared values

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5473, Issue , 2009, Pages 357-371

  Toft, Tomas ^a,b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Bit decomposition; Constant rounds multi party computation; Secret sharing

Indexed keywords

ADAPTIVE ADVERSARY; ASYMPTOTIC COMPLEXITY; BASIC IDEA; BINARY REPRESENTATIONS; CONSTANT-ROUNDS MULTI-PARTY COMPUTATION; MULTIPARTY COMPUTATION; SECRET SHARING; SHARED VALUES; SOLUTION MATCHING;

CRYPTOGRAPHY;

EID: 67650128310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00862-7_24     Document Type: Conference Paper

References (8)

1. [ACS02] Algesheimer, J., Camenisch, J.L., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417-432. Springer, Heidelberg (2002)
2. [BGW88] Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th Annual ACM Symposium on Theory of Computing, pp. 1-10. ACM Press, New York (1988)
3. [DFK+06] Damgård, I.B., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285-304. Springer, Heidelberg (2006) (Pubitemid 43979854)
4. [DN03] Damgård, I.B., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247-264. Springer, Heidelberg (2003) (Pubitemid 137636946)
5. [NO07] Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343-360. Springer, Heidelberg (2007)
6. [Sha79] Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612-613 (1979)
7. [ST06] Schoenmakers, B., Tuyls, P.: Efficient binary conversion for paillier encrypted values. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 522-537. Springer, Heidelberg (2006) (Pubitemid 44072259)
8. [Tof07] Toft, T.: Primitives and Applications for Multi-party Computation. PhD thesis, University of Aarhus (2007), http://www.daimi.au.dk/ ~ttoft/publications/dissertation.pdf