Cheating resistant implicit security

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015
EditorsD. R. Avresky, D. R. Avresky, Yann Busnel
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages57-62
Number of pages6
ISBN (Electronic)0769556817, 9781509018499
DOIs
StatePublished - Jan 4 2016
Event14th IEEE International Symposium on Network Computing and Applications, NCA 2015 - Cambridge, United States
Duration: Sep 28 2015Sep 30 2015

Publication series

NameProceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015

Other

Other14th IEEE International Symposium on Network Computing and Applications, NCA 2015
CountryUnited States
CityCambridge
Period9/28/159/30/15

Fingerprint

Peer to peer networks

Keywords

  • Cheating prevention
  • Implicit security
  • Multi-path secure transmission
  • Secret sharing algorithm

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Parakh, A. (2016). Cheating resistant implicit security. In D. R. Avresky, D. R. Avresky, & Y. Busnel (Eds.), Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015 (pp. 57-62). [7371703] (Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/NCA.2015.32

Cheating resistant implicit security. / Parakh, Abhishek.

Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015. ed. / D. R. Avresky; D. R. Avresky; Yann Busnel. Institute of Electrical and Electronics Engineers Inc., 2016. p. 57-62 7371703 (Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parakh, A 2016, Cheating resistant implicit security. in DR Avresky, DR Avresky & Y Busnel (eds), Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015., 7371703, Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015, Institute of Electrical and Electronics Engineers Inc., pp. 57-62, 14th IEEE International Symposium on Network Computing and Applications, NCA 2015, Cambridge, United States, 9/28/15. https://doi.org/10.1109/NCA.2015.32
Parakh A. Cheating resistant implicit security. In Avresky DR, Avresky DR, Busnel Y, editors, Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015. Institute of Electrical and Electronics Engineers Inc. 2016. p. 57-62. 7371703. (Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015). https://doi.org/10.1109/NCA.2015.32
Parakh, Abhishek. / Cheating resistant implicit security. Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015. editor / D. R. Avresky ; D. R. Avresky ; Yann Busnel. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 57-62 (Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015).
@inproceedings{675d6417e9884850b8da6aaeafda59af,
title = "Cheating resistant implicit security",
abstract = "This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.",
keywords = "Cheating prevention, Implicit security, Multi-path secure transmission, Secret sharing algorithm",
author = "Abhishek Parakh",
year = "2016",
month = "1",
day = "4",
doi = "10.1109/NCA.2015.32",
language = "English (US)",
series = "Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "57--62",
editor = "Avresky, {D. R.} and Avresky, {D. R.} and Yann Busnel",
booktitle = "Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015",

}

TY - GEN

T1 - Cheating resistant implicit security

AU - Parakh, Abhishek

PY - 2016/1/4

Y1 - 2016/1/4

N2 - This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.

AB - This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.

KW - Cheating prevention

KW - Implicit security

KW - Multi-path secure transmission

KW - Secret sharing algorithm

UR - http://www.scopus.com/inward/record.url?scp=84963616564&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84963616564&partnerID=8YFLogxK

U2 - 10.1109/NCA.2015.32

DO - 10.1109/NCA.2015.32

M3 - Conference contribution

AN - SCOPUS:84963616564

T3 - Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015

SP - 57

EP - 62

BT - Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015

A2 - Avresky, D. R.

A2 - Avresky, D. R.

A2 - Busnel, Yann

PB - Institute of Electrical and Electronics Engineers Inc.

ER -