Cheating resistant implicit security

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

1 Scopus citations

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

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Cheating resistant implicit security'. Together they form a unique fingerprint.

Cite this