Equational Security Proofs of Oblivious Transfer Protocols

Author(s):  
Baiyu Li ◽  
Daniele Micciancio
2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Peter Brown ◽  
Hamza Fawzi ◽  
Omar Fawzi

AbstractThe rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum states jointly held by the adversary and the parties that are consistent with the statistics that are seen by the parties. Here, we introduce a method to approximate such entropic quantities. Applied to the setting of device-independent randomness generation and quantum key distribution, we obtain improvements on protocol rates in various settings. In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution without additional preprocessing. Furthermore, we show that our construction can be readily combined with the entropy accumulation theorem in order to establish full finite-key security proofs for these protocols.


2014 ◽  
Vol 9 (7) ◽  
pp. 1098-1107 ◽  
Author(s):  
Fuchun Guo ◽  
Yi Mu ◽  
Willy Susilo
Keyword(s):  

Author(s):  
Benoît Libert ◽  
San Ling ◽  
Fabrice Mouhartem ◽  
Khoa Nguyen ◽  
Huaxiong Wang

2016 ◽  
Vol 64 (3) ◽  
pp. 893-905 ◽  
Author(s):  
Jithin Ravi ◽  
Bikash Kumar Dey ◽  
Emanuele Viterbo

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Shuichi Katsumata ◽  
Shota Yamada ◽  
Takashi Yamakawa

Sign in / Sign up

Export Citation Format

Share Document