搜索结果: 1-9 共查到“军队指挥学 Security Reduction”相关记录9条 . 查询时间(0.125 秒)
A tight security reduction in the quantum random oracle model for code-based signature schemes
Quantum Random Oracle Quantum-Safe Cryptography Code-Based Cryptography
2017/9/28
Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature schemes can have concret...
Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction
Random Oracle Indistinguishability Security under Computational Assumptions Finding Loss
2016/12/9
The indistinguishability security of a public-key cryptosystem can be reduced to a computational hard assumption in the random oracle model, where the solution to a computational hard problem is hidde...
Waters Signatures with Optimal Security Reduction
Digital signatures Waters signatures provable security black-box reductions
2012/6/14
Waters signatures (Eurocrypt 2005) can be shown existentially unforgeable under chosen-message attacks under the assumption that the computational Diffie-Hellman problem in the underlying (pairing-fri...
Waters Signatures with Optimal Security Reduction
public-key cryptography / Digital signatures Waters signatures, provable security black-box reductions
2012/3/20
Waters signatures (Eurocrypt 2005) can be shown existentially unforgeable under chosen-message attacks under the assumption that the computational Diffie-Hellman problem in the underlying (pairing-fri...
Computationally Sound Symbolic Security Reduction Analysis of Group Key Exchange Protocol using Bilinear Pairings
Universally Composable Symbolic Analysis Computational Soundness Bilinear Pairings Group Key Exchange Protocol Forward Secrecy
2012/3/26
Canetti and Herzog have proposed a universally composable symbolic analysis (UCSA) of mutual authentication and key exchange protocols within universally composable security framework. It is fully aut...
Efficient Key Exchange with Tight Security Reduction
Efficient Key Exchange Tight Security Reduction
2009/6/23
In this paper, we propose two authenticated key exchange (AKE) protocols, SMEN and
SMEN−, which have efficient online computation and tight security proof in the extended
Canetti-Krawczyk (eCK...
An Efficient Authenticated Key Exchange Protocol with a Tight Security Reduction
authenticated key exchange Gap Diffie-Hellman assumption extended CanettiKrawzcyk model
2009/6/5
In this paper, we present a new authenticated key exchange(AKE) protocol, called
NETS, and prove its security in the extended Canetti-Krawczyk model under the random oracle
assumption and the gap Di...
Efficient Identity-Based Encryption with Tight Security Reduction
ID-based encryption tight security reduction
2009/3/4
In a famous paper of Crypto'01, Boneh and Franklin pro-
posed the first identity-based encryption scheme (IBE), around fifteen
years after the concept was introduced by Shamir. Their scheme security...
An Efficient CDH-based Signature Scheme With a Tight Security Reduction
Public-key cryptography signature schemes discrete logarithm problem
2009/1/15
At Eurocrypt ’03, Goh and Jarecki showed that, contrary
to other signature schemes in the discrete-log setting, the EDL signature
scheme has a tight security reduction, namely to the Computational
...