Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1067
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaitra, Arpita
dc.contributor.authorDe, Sourya Joyee
dc.contributor.authorPaul, Goutam
dc.contributor.authorPal, Asim Kumar
dc.date.accessioned2021-08-26T06:03:24Z-
dc.date.available2021-08-26T06:03:24Z-
dc.date.issued2015
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84939439477&doi=10.1103%2fPhysRevA.92.022305&partnerID=40&md5=3fae9a10e2aa2435eca5f75d1fcd4b93
dc.identifier.urihttps://ir.iimcal.ac.in:8443/jspui/handle/123456789/1067-
dc.descriptionMaitra, Arpita, Management Information Systems Group, Indian Institute of Management Calcutta, Diamond Harbour Road, Joka, Kolkata, West Bengal, 700104, India; De, Sourya Joyee, Cryptology and Security Research Unit, R. C. Bose Centre for Cryptology and Security, Indian Statistical Institute, 203 Barrackpore Trunk Road, Kolkata, 700108, India; Paul, Goutam, Cryptology and Security Research Unit, R. C. Bose Centre for Cryptology and Security, Indian Statistical Institute, 203 Barrackpore Trunk Road, Kolkata, 700108, India; Pal, Asim Kumar, Management Information Systems Group, Indian Institute of Management Calcutta, Diamond Harbour Road, Joka, Kolkata, West Bengal, 700104, India
dc.descriptionISSN/ISBN - 10502947
dc.descriptionDOI - 10.1103/PhysRevA.92.022305
dc.description.abstractA rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his or her utility by obtaining the secret alone. Quantum secret sharing schemes, derived either from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), is correct, and achieves strict Nash equilibrium. � 2015 American Physical Society.
dc.publisherSCOPUS
dc.publisherPhysical Review A - Atomic, Molecular, and Optical Physics
dc.publisherAmerican Physical Society
dc.relation.ispartofseries92(2)
dc.subjectSecret Sharing
dc.subjectSequential Equilibrium
dc.subjectSecure Computation
dc.titleProposal for quantum rational secret sharing
dc.typeArticle
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.