Sequential (t,n) multi secret sharing scheme for level-ordered access structure

dc.contributor.author Tentu, Appala Naidu
dc.contributor.author Bhavani, K.
dc.contributor.author Basit, Abdul
dc.contributor.author Venkaiah, V. Ch
dc.date.accessioned 2022-03-27T05:50:59Z
dc.date.available 2022-03-27T05:50:59Z
dc.date.issued 2021-12-01
dc.description.abstract A new access structure called the Level ordered Access Structure (LoAS) is introduced in Pattipati et al. (IJ Netw Secur 18(5):874–881, 2016) and proposed a sequential secret sharing scheme that realises this access structure. This is similar to multilevel access structure but enforces ordering among levels while reconstructing the secret. In this paper, we extended a secret sharing scheme for multiple secrets to realise LoAS. The construction uses public key primitives with Lagrange interpolation. In this scheme, multiple secrets are distributed one each among the levels. The scheme uses the concepts of quadratic residues and discrete logarithm problem. Reconstruction of the secrets is such that participants of different levels find their respective level secrets only after they get their immediate higher level permission. The novelty of the scheme is that, it achieves ordering concept. Performance and security analysis of the scheme is also discussed.
dc.identifier.citation International Journal of Information Technology (Singapore). v.13(6)
dc.identifier.issn 25112104
dc.identifier.uri 10.1007/s41870-018-0179-z
dc.identifier.uri https://link.springer.com/10.1007/s41870-018-0179-z
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/8300
dc.subject Discrete logarithm problem
dc.subject Multi-secrets
dc.subject Multipartite
dc.subject Quadratic residue
dc.subject Secret sharing
dc.subject Sequential
dc.title Sequential (t,n) multi secret sharing scheme for level-ordered access structure
dc.type Journal. Article
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: