搜索结果: 1-8 共查到“军事学 Tightness”相关记录8条 . 查询时间(0.081 秒)
Highly Efficient Key Exchange Protocols with Optimal Tightness -- Enabling real-world deployments with theoretically sound parameters
AKE provable security tightness
2019/6/24
In this paper we give nearly-tight reductions for modern implicitly authenticated Diffie-Hellman protocols in the style of the Signal and Noise protocols which are extremely simple and efficient. Unli...
On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
non-tightness quantum random oracle model Fujisaki-Okamoto
2019/5/21
Key encapsulation mechanism (KEM) variants of the Fujisaki-Okamoto (FO) transformation (CRYPTO 1999 and Journal of Cryptology 2013) that turn a weakly-secure public-key encryption (PKE) into an IND-CC...
On the Tightness of Forward-Secure Signature Reductions
Forward-security signatures lossy identification
2017/8/10
In this paper, we revisit the security of factoring-based signature schemes built via the Fiat-Shamir transform and show that they can admit tighter reductions to certain decisional complexity assumpt...
Another Look at Tightness II: Practical Issues in Cryptography
tightness complexity leveraging HMAC
2016/4/12
How to deal with large tightness gaps in security proofs is a vexing issue in
cryptography. Even when analyzing protocols that are of practical importance, leading
researchers often fail to treat th...
Since its introduction in 2010 by Lyubashevsky, Peikert and Regev, the Ring Learning With Errors problem (Ring-LWE) has been widely used as a building block for cryptographic primitives, due to its gr...
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound
oblivious RAM secure multi-party computation
2016/1/7
We propose a new tree-based ORAM scheme called Circuit ORAM. Circuit ORAM makes
both theoretical and practical contributions. From a theoretical perspective, Circuit ORAM
shows that the well-known G...
Unconditional Tightness Bounds for Generic Reductions: The Exact Security of Schnorr Signatures, Revisited
Schnorr signatures meta-reductions
2014/3/12
A long line of research investigates the existence of tight security reductions for the Schnorr signature scheme. Most of these works presented lower tightness bounds, most recently Seurin (Eurocrypt ...
We examine a natural, but non-tight, reductionist security proof for deterministic message authentication code (MAC) schemes in the multi-user setting. If security parameters for the MAC scheme are se...