会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHOD AND STRUCTURE FOR SELF-SEALED JOINT PROOF-OF-KNOWLEDGE AND DIFFIE-HELLMAN KEY-EXCHANGE PROTOCOLS
    • 自密封联合验证密码交换协议的方法与结构
    • WO2009056048A1
    • 2009-05-07
    • PCT/CN2008/072794
    • 2008-10-23
    • YAO, Andrew C.ZHAO, YunleiDING, SufenYAO, France F.
    • YAO, Andrew C.ZHAO, YunleiDING, SufenYAO, France F.
    • H04L9/32
    • H04L9/0841H04L9/3218
    • A method (and structure) for a party (the prover) to prove its knowledge, jointly and non-malleably, of multiple secret (fixed and/or ephemeral) Diffie-Hellman exponents (DH-exponents), corresponding to its public (fixed and/or ephemeral) DH-components and with respect to the public (fixed and/or ephemeral) challenging DH-components from another party (the verifier). The joint proof-of-knowledge (JPOK) consists of secrets made by multiplying multiple DH-secrets, which can be generated and verified by each party by its own secret DH-exponents and the public DH-components of both parties. To ensure the non-malleability of the JPOK, the method invented herein makes all these multiplied DH-secrets to be independent, and makes the session-tag committed to the multiplied DH-secrets. To preserve players' privacy and/or to improve protocol efficiency, the invented method makes the DH-secrets to be multiplied to further satisfy at least one of the following (besides above independence and commitments properties): (1) Deniability: all the DH-secrets to be multiplied can be computed out merely from the ephemeral secret DH-exponents and the public DH-components of both parties; (2) Pre-computability: a DH-secret involving a fixed DH-component of a party can be offline pre-computed by its peer; (3) Post-ID computability: a DH-secret involving an ephemeral DH-component of a party can be computed by its peer without knowing that party's identity and/or fixed DH-components. The secrets made by multiplying multiple DH-secrets can then be used to derive session-keys and to generate and verify authenticators between the parties. The invented method can also be used in parallel or subsequently by the parties, possibly with reserved player roles in different runs of the method, for mutual identifications, key confirmations, and for achieving more advanced cryptographic protocols in various settings.
    • 一个方法(和结构)一方(证明者)证明其共同和不可塑造的多个秘密(固定和/或短暂)Diffie-Hellman指数(DH指数)的知识,对应于其公共(固定的 和/或短暂的)DH组分和相对于公众(固定和/或短暂的)挑战来自另一方(验证者)的DH组分。 联合证据知识(JPOK)包括通过乘以多个DH秘密而产生的秘密,每个秘密可以由各方由其自己的秘密DH指数和双方的公共部门组成部分产生和验证。 为了确保JPOK的不可延展性,本文所发明的方法使得所有这些相乘的DH秘密是独立的,并且使会话标签落实到繁殖的DH秘密。 为了保护玩家的隐私和/或提高协议效率,本发明的方法使得DH秘密被乘以进一步满足以下至少之一(除了上述独立性和承诺属性之外):(1)可否性:所有DH - 可以仅从短暂的秘密DH指数和双方的公共部门组成部分计算出乘数的百分比; (2)预可计算性:涉及一方的固定DH分量的DH秘密可以由对等体预先计算; (3)Post-ID可计算性:涉及一方的临时DH分量的DH秘密可以由对端计算,而不知道该方的身份和/或固定的DH组件。 然后可以使用乘以多个DH秘密产生的秘密来导出会话密钥,并生成和验证双方之间的验证方。 本发明的方法还可以并行地或随后由各方使用,可能在方法的不同运行中具有保留的播放器角色,用于相互标识,密钥确认以及在各种设置中实现更高级的加密协议。