Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/7528
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMandal, Sudipa-
dc.date.accessioned2025-02-21T07:23:12Z-
dc.date.available2025-02-21T07:23:12Z-
dc.date.issued2024-07-
dc.identifier.citation35p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/7528-
dc.descriptionDissertation under the guidance of Asso. Prof. Fr´ed´eric Dupuis and Prof. Louis Salvail and Asso. Prof. Goutam Paulen_US
dc.description.abstractIn the bounded quantum storage model (BQSM), it is possible to realize oblivious transfer (OT) non-interactively. However, existing schemes are non-interactive only when the erasure rate is low. Quantum communication, even over short distances, is subject to relatively high erasure rates. The standard approach to handle erasures is to retain only the successfully received pulses and then implement OT, which needs an additional message from the receiver to the sender. Consequently, the OT scheme becomes interactive. Our research aims to investigate the possibility of achieving non-interactive OT in the BQSM, even under conditions of high erasure rates. To this end, we propose exploring the use of coding techniques, such as fountain codes, with a particular focus on Raptor codes. These codes have the potential to mitigate the need for an additional message from the receiver to the sender, thereby maintaining non-interactivity in the presence of high loss rates.en_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;;CrS;22-20-
dc.subjectBounded quantum storage model (BQSM)en_US
dc.subjectOblivious transfer (OT)en_US
dc.subjectRaptor codesen_US
dc.titlePractical and Non-Interactive Oblivious Transfer in the Bounded Quantum Storage Modelen_US
dc.typeOtheren_US
Appears in Collections:Dissertations - M Tech (CRS)

Files in This Item:
File Description SizeFormat 
Sudipa_Crs2220.pdfDissertations - M Tech (CRS)6.11 MBAdobe PDFView/Open


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