secure multiparty computation

K.Ravikumar,B. Gnanam Jeyanthi

Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology

ISSN: 2321-3337          Impact Factor:1.521         Volume:3         Issue:1         Year: 26 June,2014         Pages:337-343

International Journal of Advanced Research in Computer Science Engineering and Information Technology

Abstract

In Secure Multiparty computation model, each processes contain a tamper-proof security module. Security modules can be trusted by other processes and can establish secure channels between each hosts. The availability of security modules is restricted by their hosts because a corrupted party can stop the execution of its own security module and also drop message sent by or to its security module. We show that SMC can be implemented to reduce faults based on the security modules of its own.

Kewords

secret sharing,TTP

Reference

1)Roberto Cortin˜ as, Felix C. Freiling, Marjan Ghajar-Azadanlou,Alberto Lafuente, Mikel Larrea, Lucia Draque Penso, and Iratxe Soraluze, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, Secure Failure Detection and Consensus in TrustedPals, VOL. 9, NO. 4, JULY/AUGUST 2012. 2) Zinaida Benenson1, Milan Fort2, Felix Freiling3, Dogan Kesdogan2, and Lucia Draque Penso3 TrustedPals: Secure Multiparty Computation Implemented with Smart Cards. 3) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGIES, VOL. 01, ISSUE 05, OCT 2013 ISSN 2321 –8665,Secure Failure Detection and Aggrements In Trusted Pals. 4)Ivan damgad,Yuval Ishai, and Mikkel korigaard,Perfectly Secure Multiparty Computation and the computational overhea of cryptography, H.Gilbert(Ed.):EUROCRYPT 2010, LNCS 6110, PP. 445 -465,2010. 5) Iwan damgard, and Yuval Ishai, Scalable Secure Multiparty Computation, C.DWork(Ed.):CRYPTO 2006, LNCS 4117, PP.501-520, 2006, 6) YiSun,1 Qiaoyan Wen,1 Yudong Zhang,2 Hua Zhang,1 and Zhengping Jin1 Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel,Volume 2013 (2013),Article ID 172718, 5pages.