A Secured MultiParty Computational Protocol to Protect Cyber Space

In this paper, we show how our secured multiparty computation (SMC) protocols protect the data of an organization during the war from the cyberspace war when a large number of defense units interact with one another, while hiding the identity and computations done by them. SMC is a problem of inform...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information security journal. Ročník 19; číslo 4; s. 175 - 181
Hlavní autoři: Mishra, Durgesh Kumar, Chandwani, Manohar
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 11.08.2010
Témata:
Algorithms
Computation
Computer information security
correctness
Cryptography
cyberspace
Keys
Multilevel
Organizations
privacy
secure multiparty computation (SMC)
security
Sheet molding compounds
trusted third party (TTP)
ISSN:1939-3555, 1939-3547
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we show how our secured multiparty computation (SMC) protocols protect the data of an organization during the war from the cyberspace war when a large number of defense units interact with one another, while hiding the identity and computations done by them. SMC is a problem of information security when large organizations interact with one another for huge data sharing and data exchange. It is quite possible that during sharing and exchange, the private data also get hacked. In order to protect and secure the private data, the protocols of SMC need to be deployed in the large computer networks on which the organizations work. The protocols work at the micro-level in terms of cryptography with which the data are encrypted and then shared, while allowing the keys to be used for sharable data while also keeping the keys untouched for private data. At the macro level, multilevel architectures are used for different types of security to be achieved. The computation part of the secured multiparty computation is based on the algorithmic complexity theory. The algorithms realize the protocols in such a way that it is tedious to break (decrypt) the keys to hack the private data.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1939-3555
1939-3547
DOI:10.1080/19393550903532553