Академический Документы
Профессиональный Документы
Культура Документы
'`
_
Fake Data
'`
--- F I
V: V+ V-
Fig. Z. Token ring network consisting of parties and
End
.:. Use distO to distribute Ei and Ti among
Vi
.:. For every virtual party Vi
.:. Send the data of Vi to TP
.:. Compute the fnction gO using Ei and Ti at TP
.:. TP Announces Result
D. Securit Analysis
Whenever a data is sent fom a paricular virtual party to a
TP, there is lin probability for the TP to determine the
source party. Also the data is encrypted so to get the actual
data of a pay the TP has to get data fom all the virtual
paries of a particular party.
The TP gets the data of all the virtual parties. If the TP is
corrupt then it may try to hack the data. It may guess the data
of all the virtual parties of a particular paty.
There are n number of parties Pi each having mi number of
virtual paties. The probability of hacking the data of one
virtual party Vkj of k
t
party is
P(Vk) =
.
,
_
;
=
1
To hack the data of one pary, the data of all its virtual
parties need to be hacked. The probabilit of hacking the data
of one paty P k is
1
The probability of hacking the data of a party P; is shown in
graph below.
_A"_"
1 e JO
Fig. . Graph between number of virtual parties ad probability of
hacking.
Wtbs,
___
"
08
Ii
Fig. 4. Graph between number of parties and probability of hacking.
As we can see in above fgure, the probability of hacking is
nearly zero. Thus the protocol is suffciently secure.
C Statistical Application
Mean
Ori
g
inal
Virtual Party Protocol Version
.
_|!,-!. -! ,-!.
)
=
.
T
(I |.-/. -/
,-/.)J
.
Variance
Ori
g
inal
1
.
( )
.
.
=-
_
x
n
-
1
.
Virtual Party Protocol Version
.
_-,-- ,}
s
.
=
.
T
(I|/.-/. -/
,-... 7k)J
-
1
.
Where
,-
. -,-,
h d d'f k
ae t e secon ary mo I ler to ens
ad
. . . .
( )
.
,-
. -
,-
,}
Standard Deviation
Ori
g
inal
1
.( _ )
.
s=
-_
H 1
.
Virtual Party Protocol Version
=
Where
.
_ -
.
. - - ,}
.
,-
. -,-,
h d d'f k
1 1 1 1
are t e secon ary mo I ler to ens
ad
Skewness
Ori
g
inal
.
[
x
J
,
,
=
,
=
_,/-/-/ -/ )
.
Where
/ -/-/
-
r
J
,
, , , ,
=
/.-/ . -/ ,-/ .
Kurtosis
Ori
g
inal
III. LMLLL5M
We have corroborated the use token ring network and a
virtual party protocol to perform secure multi-party statistical
computations. H this protocol, computation was performed on
encrypted data at TTP using modifer tokens and a special
computation fnction is described. Virtual parties were used to
encrypt the data and to hide its source. A detailed security
analysis showed that probability of hacking in practical is
nearly zero. With the use of token ring network, the overall
security of the system goes up and the complexity reduces.
The protocol is applicable in may statistical computations for
increasing the security. The BPO industry can mae use of
such protocols to work on third party data.
HLLKLMLL5
[1] Feng Zhang, Gansen Zhao and Tingyan Xing, "Privacy
Preserving Distributed k-Neaest Neighbor Mining on
Horizontally Partitioned Multi-Paty Data," Advanced Data
Mining and Applications, Lecture Notes in Computer Science,
Springer Berlin / Heidelberg, pp. 755-762, vol. 5678/2009, DOl:
10.1007/978-3-642-03348-3 80.
[2] Jua Gaay, Clint Givens and Rafail Ostrovsky, "Secure
Messae Trasmission with Small Public Discussion," Adances
in Crptolog - EUROCRYPT 2010, Lecture Notes in Computer
Science, Springer Berlin / Heidelberg, pp. 177-196, vol.
6110/2010, DOl: 10.1007/978-3-642-13190-5_9.
[3] Bin Yang and Hiroshi Naagawa, "Computation of Ratios of
Secure Summations in Multi-paty Privacy-Preserving Latent
Dirichlet Allocation," Advances in Knowledge Discovery and
Data Mining, Lecture Notes in Computer Science, Springer
Berlin / Heidelberg, pp. 189-197, vol. 6118/2010, DOl:
10.1007/978-3-642-13657-3_22.
[4] Peter Bogetof, Dan Lund Christensen, Iva Damgard, Martin
Geisler, Thomas Jakobsen, Mikkel Kmigaad, Janus Dam
Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jaob Pagter,
Michael Schwartzbach and Tomas Tof, "Secure Multipart
Computation Goes Live," Financial Crptography and Data
Securit: 13th Interational Confrence, FC 2009, Accra Beach,
Barbados, Februar 23-26, 2009, Lecture Notes In Computer
Science, Springer-Verlag Berlin, Heidelberg, pp. 325-343, DOl:
10.1007/978-3-642-03549-4_20.
[5] Tomas Tof, "Solving Linear Programs Using Multiparty
Computation," Financial Crptography and Data Securit,
Lecture Notes in Computer Science, Springer Berlin /
Heidelberg, pp. 90-107, vol. 5628/2009, DOl: 10.1007/978-3-
642-03549-4_6.
[6] Wenliang Du and Zhiun Zhan, "A practical approach to solve
secure multi-party computation problems," In New Securit
Paradigms Workhop 2002.
[7] Scott Yilek, "Resettable Public-Key Encryption: How to
Encrpt on a Virtual Machine," Topics in Crptolog - CT-RA
2010, Lecture Notes in Computer Science, Springer Berlin /
Heidelberg, pp. 41-56, vol. 5985/2010, DOl: 10.1007/978-3-
642-11925-5 4.
[8] Dominique Unruh , "Universally Composable Quantum Multi
pa Computation," Adances in Crtolog - EUROCRYPT
2010, Lecture Notes in Computer Science, Springer Berlin /
Heidelberg, pp. 486-505, vol. 6110/2010, DOl: 10.1007/978-3-
642-13190-5_25.
[9] Renato Renner, Stefan Wolf and JOrg Wullschleger, "Trade-Ofs
in Information-Theoretic Multi-party One-Way Key
Agreement," Information Theoretic Securit, Lecture Notes in
Computer Science, Springer Berlin / Heidelberg, pp. 65-75, vol.
4883/2009, DOl: 10.1007/978-3-642-10230-1_5.
[10] Gagan Aggarwal, Nina Mishra and Benny Pinkas, "Secure
Computation of the Median (and Other Elements of Specifed
Raks)," Journal of Crptolog, Springer New York, pp. 373-
401, vol. 23, no. 3, DOl: 1O.1007/s00145-01O-9059-9.
[11] Michel Abdalla, Celine Chevalier, Mark Maulis and David
Pointcheval, "Flexible Group Key Exchange with On-demad
Computation of Subgroup Keys," Progress in Crptolog -
AFRlCACRYPT 2010, Lecture Notes in Computer Science,
Springer Berlin / Heidelberg, pp. 351-368, DOl: 10.1007/978-3-
642-12678-9_21.
[12] Rohit Pathak, Satyadhar Joshi : Secure Multi Paty Computation
using Virtual Paries for Computation on Encrypted Data. In:
Proceedings of The First Interational workshop on Mobile
Wireless Networks (MoWiN 2009) The 3rd Interational
Conference on Information Security and Assurance. June 2009.
DOl: 10.1007/978-3-642-02617-1 42
[13] 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 Asian
Himalayas Regional IEEEIIFIP Interational Conference on
INTERET AH - ICI 2009. November 2009. DOl:
1O.1109/AHICI.2009.5340298
[14] Rohit Pathak, Satyadhar Joshi : SMC protocol for privacy
preserving in banking computations along with security analysis
. In: Proceedings of The First South Central Asian Himalayas
Regional IEEEIIFIP Interational Conference on INTERET
AH ICI 2009. November 2009. DOl:
1O.1109/AHICI.2009.5340328
[15] Jua A. Garay and Rafail Ostrovsky, "Almost-Everywhere
Secure Computation," Advances in Crptolog - EUROCRYPT
2008, Lecture Notes in Computer Science, Springer Berlin /
Heidelberg, vol. 4965/2008, pp. 307-323, DOl: 10.1007/978-3-
540-78967-3 18.
[16] Zhijun Zhan and Wenliag Du, "Privacy-Preserving Data
Mining Using Multi-Group Randomized Response Techniques,"
Technical Report, June 2003.
[17] Wenliang Du and Mikhail J. Ata1lah, "Secure MultiParty
Computation Problems ad Their Applications: A Review and
Open Problems," In Proc. New Securit Paradigms Workhop,
pp. 11-20, Cloudcrof, New Mexico, USA, September 11-
13,2001.
[18] Zinaida Benenson, Milan Fort, Felix Freiling, Doga Kesdogan
and Lucia Draque Penso, "TrustedPals: Secure Multiparty
Computation Implemented with Sma Cards," Computer
Securit - ESORlCS 2006, Lecture Notes in Computer Science,
Springer Berlin / Heidelberg, vol. 4189/2006, pp. 34-48, DOl:
10.1007/11863908_3.