BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:4bb005dc-a97e-4c60-b424-f6dea3b0bab3
X-WR-CALNAME:[gt-iq] Léo Colisson
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20250330T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:4bb005dc-a97e-4c60-b424-f6dea3b0bab3
DTSTAMP:20260510T232231Z
CLASS:PUBLIC
DESCRIPTION:Oblivious Transfer from Zero-Knowledge Proofs\, or How to Achie
 ve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Q
 uantum States Without Structure \n\nOblivious Transfer (OT) is an extremel
 y powerful cryptographic primitive\, as it was shown to be sufficient to p
 erform multi-party computing. We provide a generic construction to turn an
 y classical Zero-Knowledge (ZK) protocol into a composable (quantum) obliv
 ious transfer (OT) protocol\, mostly lifting the round-complexity properti
 es and security guarantees (plain-model/statistical security/unstructured 
 functions...) of the ZK protocol to the resulting OT protocol. Such a cons
 truction is unlikely to exist classically as Cryptomania is believed to be
  different from Minicrypt.\n\nIn particular\, by instantiating our constru
 ction using Non-Interactive ZK (NIZK)\, we provide the first round-optimal
  (2-message) quantum OT protocol secure in the random oracle model\, and r
 ound-optimal extensions to string and k-out-of-n OT.\n\nAt the heart of ou
 r construction lies a new method that allows us to prove properties on a r
 eceived quantum state without revealing (too much) information on it\, eve
 n in a non-interactive way and/or with statistical guarantees when using a
 n appropriate classical ZK protocol. We can notably prove that a state has
  been partially measured (with arbitrary constraints on the set of measure
 d qubits)\, without revealing any additional information on this set. This
  notion can be seen as an analog of ZK to quantum states\, and we expect i
 t to be of independent interest as it extends complexity theory to quantum
  languages\, as illustrated by the two new complexity classes we introduce
 \, ZKstatesQIP and ZKstatesQMA. \n\n\nhttps://combalgo.labri.fr/pmwiki.php
 /Groupe/Info-Quantique
DTSTART;TZID=Europe/Paris:20230502T150000
DTEND;TZID=Europe/Paris:20230502T160000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[gt-iq] Léo Colisson
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
