Optimal Security Proofs for Signatures from Identification Schemes

2016 ◽  
pp. 33-61 ◽  
Author(s):  
Eike Kiltz ◽  
Daniel Masny ◽  
Jiaxin Pan
Keyword(s):  
Identification Schemes ◽  
Security Proofs

scholarly journals Choosing between identification schemes in noisy-news models

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Joshua C. C. Chan ◽  
Eric Eisenstat ◽  
Gary Koop
Keyword(s):  
Bayesian Methods ◽  
Moving Average ◽  
Autoregressive Moving Average ◽  
Structural Shocks ◽  
Vector Autoregressive ◽  
Identification Scheme ◽  
Identification Schemes ◽  
The One ◽  
Small Models ◽  
Structural Vector

AbstractThis paper is about identifying structural shocks in noisy-news models using structural vector autoregressive moving average (SVARMA) models. We develop a new identification scheme and efficient Bayesian methods for estimating the resulting SVARMA. We discuss how our identification scheme differs from the one which is used in existing theoretical and empirical models. Our main contributions lie in the development of methods for choosing between identification schemes. We estimate specifications with up to 20 variables using US macroeconomic data. We find that our identification scheme is preferred by the data, particularly as the size of the system is increased and that noise shocks generally play a negligible role. However, small models may overstate the importance of noise shocks.

scholarly journals Computing conditional entropies for quantum correlations

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Peter Brown ◽  
Hamza Fawzi ◽  
Omar Fawzi
Keyword(s):  
Quantum Key Distribution ◽  
Detection Efficiency ◽  
Conditional Entropy ◽  
Key Distribution ◽  
Quantum Correlations ◽  
Upper Bounds ◽  
Cryptographic Protocols ◽  
Quantum States ◽  
Security Proofs

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.

Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Shuichi Katsumata ◽  
Shota Yamada ◽  
Takashi Yamakawa
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Security Proofs
Sign in / Sign up

Export Citation Format

Share Document