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 Field | Value | Language |
---|---|---|
dc.contributor.author | Maitra, Arpita | |
dc.contributor.author | De, Sourya Joyee | |
dc.contributor.author | Paul, Goutam | |
dc.contributor.author | Pal, Asim Kumar | |
dc.date.accessioned | 2021-08-26T06:03:24Z | - |
dc.date.available | 2021-08-26T06:03:24Z | - |
dc.date.issued | 2015 | |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84939439477&doi=10.1103%2fPhysRevA.92.022305&partnerID=40&md5=3fae9a10e2aa2435eca5f75d1fcd4b93 | |
dc.identifier.uri | https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1067 | - |
dc.description | Maitra, 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.description | ISSN/ISBN - 10502947 | |
dc.description | DOI - 10.1103/PhysRevA.92.022305 | |
dc.description.abstract | A 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.publisher | SCOPUS | |
dc.publisher | Physical Review A - Atomic, Molecular, and Optical Physics | |
dc.publisher | American Physical Society | |
dc.relation.ispartofseries | 92(2) | |
dc.subject | Secret Sharing | |
dc.subject | Sequential Equilibrium | |
dc.subject | Secure Computation | |
dc.title | Proposal for quantum rational secret sharing | |
dc.type | Article | |
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.