Key-Based Steganographic Textual Secret Sharing for Confidential Messaging

Buckley, Neil J.; Nagar, Atulya K.; Arumugam, S.

doi:10.1007/978-81-322-1771-8_3

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the author's prior work [6], additional alphanumeric keys were suggested to vary the polynomial term used to encode a respective character, and in [8], different entropic metrics are compared with Kolmogorov complexity [14] in the context of SS to show equivalence between these security metrics and they prove that all entropy metrics are maximal if shares are uniformly randomly generated.…”

Section: Related Workmentioning

confidence: 99%

On the use of secret sharing as a secure multi-use pad

Buckley

Nagar

Arumugam

2016

Innovations Syst Softw Eng

Self Cite

View full text Add to dashboard Cite

Secret sharing (SS) is a cryptographic method proposed independently by Adi Shamir and George Blakley in 1979 to encode the keys of public-key cryptography by splitting them into maximally entropic shares that are distributed to participants, only revealing the secret when combined. Each new sharing instance, even of the same key, produces a different set of shares to distribute anew. This paper investigates SS as an independent cipher to secure confidential messages between a limited set of trusted participants by eliminating the need to redistribute shares. A participant's master share is permanently fixed and unlimited temporary shares are created and combined with it to reveal new messages. Security is argued against specific and general attacks.

show abstract

Section: Related Workmentioning

confidence: 99%