搜索结果: 1-7 共查到“知识库 工学 Diffie-Hellman”相关记录7条 . 查询时间(0.046 秒)
秘密共享方案的信息率是衡量秘密共享通信效率的重要指标，鉴于已有的秘密共享方案效率不高的问题，本文基于多线性对提出了信息率为m/（m+1）的可验证秘密共享方案.方案中，共享秘密为m维向量，其可验证性可利用多线性映射的多线性性质来实现；同时，在多线性Diffie-Hellman问题下，方案是可证明安全的.性能分析结果表明，与已有的相同安全级别下的秘密共享方案相比，该方案具有较高的通信效率，更适用于通信...
OAKE: A New Family of Implicitly Authenticated Diffie-Hellman Protocols
A New Family Implicitly Authenticated Diffie-Hellman Protocols
2016/1/23
Cryptography algorithm standards play a key role both to the practice of information security and to cryptography theory research. Among them, the MQV and HMQV protocols ((H)MQV, in short) are a famil...
Strongly Unforgeable Signatures Based on Computational Diffie-Hellman
Computational Diffie-Hellman Unforgeable Signatures
2015/8/5
A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message M, the adversary cannot produce a new signature on M. Strongly...
Circular-Secure Encryption from Decision Diffie-Hellman
Decision Diffie-Hellman Circular-Secure Encryption
2015/8/5
We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a ``key cycle'' usage, where we ha...
The Decision Die-Hellman assumption (ddh) is a gold mine. It enables one to construct
ecient cryptographic systems with strong security properties. In this paper we survey the recent
applications ...
针对Diffie-Hellman密钥交换协议，提出了采用观测等价关系的建模方法，证明了该方法的可靠性，并利用该方法扩展了自动工具CryptoVerif的验证能力。发现了对公钥Kerberos协议自动证明中敌手能力模型的缺陷，并提出了修正方法。利用扩展的CryptoVerif自动证明了基于Diffie-Hellman的Kerberos协议的安全性，验证了该扩展方法的有效性。与现有大部分证明方法不同的...