Documente Academic
Documente Profesional
Documente Cultură
icular party.
.
Anonymizers and address spoof mg. These techniques hide te .
There are
.
n number of p
. es Pi each havmg mi number of
identity of te actual source of data .. Te whole system can be
v
11!
a
1.11
\
..
\
\
\
\
\
\
\
\
o e , ==r' 5 =-
5
--1 5-
WPwm
Fig. 4. Graph between number of virtual parties and probability of hacking for
n=6.
X I1
-
\
\
\
\
\
\
\
.
\
\
'-~---
-
.
2.5
3.
5
tdP.uesf
1 -- - OssiVP
I -TrTMecLre
5.5
Fig. 5. Graph between number of parties and probability of hacking for k=8.
By looking at the graphs we can clearly see that te
probability of hacking the data comes out to be nearly zero.
III. CONCLUSION
We have corroborated a triTTP architecture that uses
ofirtual paties to perfor secure mUlti-party computations.
In this protocol, computation was performed on encrpted data
at CTTP using modifer tokens and a special computation
fnction is described. The use of diferent nodes to store data
(DA) and modifer tokens (MTA) has enhaced the securit of
the system. Virtual parties were used to encrpt the data and to
hide its source. A detailed security analysis showed tat
probability of hacking in practical is nearly zero. Tri-TIP
architecture helps in elevating the security of the system. The
protocol fmds its application in many statistical computations.
Many industries such as BPOs , baks, etc. can make use of
such protocols to work on shaed computations.
REFERENCES
[1] Eyal Kushilevitz, Yehuda Lindell and Tal Rabin, "Information
Theoretically Secure Protocols ad Security Under
Composition," In Proc. of the thirt-eighth annual ACM
symposium on Teor of computing, 2006, Seattle, WA, USA,
Annual ACM Symposium on Theory of Computing, pp. 109 -
118, DOl: http:/doi. acm.org/10. 1145/1132516.1132532.
[2] Arpita Patra, Ashish Choudhary and C. Pandu Ragan,
"Information Theoreticaly Secure Multi Party Set Intersection
Re-visited," Selected Areas in Crptography, Lecture Notes in
Computer Science, Springer Berlin 1 Heidelberg, pp. 71-91, vol.
586712009, DOl: 10.1007/978-3-642-05445-75
[3] G. Sathya Naayanan, T. Aishwaya, Anugra Agrawal, Arpita
Patra, Ashish Chouday ad C. Padu Rangan, "Multi Paty
Distributed Private Matching, Set Disjointness ad Cardinality
of Set Intersection with Information Theoretic Security,"
Crptology and Network Securit, Lecture Notes in Computer
Science, Springer Berlin 1 Heidelberg, pp. 21-40, vol.
588812009, DOl: 10.1007/978-3-642-10433-6_2.
[4] Haunaga Hiwatari, Keisuke Tanaka, Tomoyuki Asano ad
Koichi Sakumoto, "Multi-recipient Public-Key Encryption from
Simulators in Security Poofs," Information Securit and
Privac, Lecture Notes in Computer Science, Springer Berin 1
Heidelberg, pp. 293-308, vol. 55942009, DOl: 10.1007/978-3-
642-02620-C21.
[5] Joel Alwen, Jonatha Katz, Yehuda Lindell, Giuseppe Persiao,
abhi shelat ad Iva Visconti, "Collusion-Free Multiparty
Computation in the Mediated Model," In Proc. of the 29th
Annual Interational Crptology Conference on Advances in
Crptology, Santa Barbara, CA, Lecture Notes In Computer
Science, Springer-Verlag Berlin, Heidelberg, pp. 524 - 540,
vol. 5677, DOl: 10.1007/978-3-642-03356-8_31.
[6] Seung Geol Choi, Ariel Elbaz, Ta Malkin ad Moti Yung,
"Secure Multi-party Computation Minimizing Online Rounds,"
Advances in Crptology - ASIACRYPT 2009, Lecture Notes in
Computer Science, Springer Berlin 1 Heidelberg, pp. 268-286,
vol. 591212009, DOl: 10.1007/978-3-642-10366-7_16.
[7] Xin Liao, Qiao-ya Wen, Ying Sun ad Jie Zhag, "Multi
party Covert Communication with Steganography and Quatum
Secret Shaing," Te Joural of Systems and Sofware (2008),
DOI:IO.10161j. jss.201O.04.076.
[8] Yu Long and Kefei Chen, "Effcient chosen-ciphertext secure
certifcateless threshold key encapsulation mechaism,"
Information Sciences, pp. 1167-1181, vol. 180, no. 7, 1 April
2010, DOl: 1O.1016j.ins.2009.12.008.
[9] Matthew Rougha ad Yin Zhang, "Secure Distributed Data
Mining and Its Application to Large-Scale Network
Measurements," ACM SIGCOMM Computer Communication
Review, pp. 7-14, vol. 36, no. 1, Jauary 2006, DOl:
http://doi. acm.orgllO. 114511111322.1111326.
[10] Mayank Bawa. Roberto J. Bayado Jr, Rakesh Agrawal and
Jaideep Vaidya. "Privacy-preserving indexing of documents on
the network," Joural The VWB Joural, Springer Berlin 1
Heidelberg, pp. 837-856, vol. 18, no. 4, DOl: 1O.1007/s00778-
008-0129-7.
[11] Rohit Patha, Satyadhar Joshi : Secure Multi Party
Computation using Virtual Parties for Computation on
Encrypted Data. In: Poceedings of The First Interational
workshop on Mobile & Wireless Networks (MoWiN 2009) The
3rd Interational Conference on Information Security ad
Assurance. June 2009. DOl: 10. 1007/978-3-642-02617-1_42
[12] Rohit Pathak, Satyadhar Joshi : Analysis of security issues in
SMC based RFID in supply chain management with energy
modeling . In: Proceedings of The First South Central Asia
Himalayas Regiona IEEElIFIP Interational Conference on
INTERNET AH - ICI 2009. November 2009. DOl:
10.11091 AHICI. 2009 .5340298
[13] Rohit Pathak, Satyadha Joshi : SMC protocol for privacy
preserving in banking computations along with security aalysis
. In: Poceedings of The First South Central Asia Himalayas
Regional IEEElIFIP Interational Conference on INTERNET
AH ICI 2009. November 2009. DOl:
10.11091 AHICI. 2009 .5340328
[14] Sumit Chakraborty, Satish Kuma Sehgal and Asim Kumar Pal,
"Privacy Peserving E-Negotiation Protocols based on Secure
Multi-paty Computation," In Proc. IEEE SoutheastCon, 2005,
8-10 April 2005, pp. 455 461, DOl:
10.1109/SECON.2005. 1423287.
[15] Mikhail Atallah, Marina Bykova. Jiangtao Li, Keith Frikken and
Merca Topkara, "Private Collaborative Forecasting ad
Benchmarking," In WPES '04: Proceedings of the 2004 ACM
workhop on Privac in the electronic societ (New York, NY
USA, 200), ACM Press, pp. 103-114.
[16] Vassilios S. Verykios, Elisa Bertino, Igor Nai Fovino, Loredana
Paasiliti Provenza, Yucel Saygin and Yannis Theodoridis,
"State-of-the-art in Privacy Preserving Data Mining," ACM
SIGMOD Record pp. 50-57, vol. 33, no. 1, DOl:
http://doi.acm.org/IO. 1145/974121.974131.
[17] Artak Amirbekyan and Vladimir Estivill-Castro, "Practical
Protocol for Yao's Millionaires Problem Enables Secure Multi
Party Computation of Metrics ad Effcient Pivacy-Preserving
k-NN for Large Data Sets," Knowledge and Inoration
Systems, Springer-Verlag Singapore P., 2009.
[18] Kun Liu, Hillol Kargupta ad Jessica Ryan, "Radom
Projection-Based Multiplicative Data Perturbation for Pivacy
Preserving Distributed Data Mining," IEEE TNSACTIONS
ON KOWLEDGE AND DATA ENGINEERIG, pp. 92-106,
vol. 18, no. 1, Jauary 2006.
[19] Ala F. Karr, Xiaodong Lin ad Ashish P. Sail, "Regression
on Distributed Databases via Secure Multi-Paty Computation,"
In Prc. of the 2004 annual national conference on Digital
goverment research, Seattle, W A, pp. 1-2, vol. 262.
[20] Durgesh Kuma Mishra and Manohar Chandwani, "Arithmetic
cryptography protocol for secure multi-paty computation," In
Proc. Of IEEE SoutheastCon, 2007, Richmond, VA, 22-25
Mach 2007, pp. 22 - 22, DOl: 10.1109/SECON.2007.342846.