学术报告|基于加法密钥派生和预签名的门限ECDSA签名算法分析

admin 2023年9月12日16:41:57评论13 views字数 1351阅读4分30秒阅读模式

浙江大学网络空间安全学院

学术报告



学术报告|基于加法密钥派生和预签名的门限ECDSA签名算法分析


Jens Groth

Principal Researcher

DFINITY Foundation



An analysis of ECDSA signatures with additive key derivation and presignatures motivated by a threshold ECDSA signing service

2023年9月18日(周一)12:00-13:00

浙江大学玉泉校区曹光彪大楼东楼502

腾讯会议:350-243-370

  摘 要  

In this talk we will give an introduction to the Internet Computer and dive into the threshold ECDSA signing service that enables smart contracts to sign Bitcoin and Ethereum transactions. The ECDSA signing service supports BIP32 key derivation such that all smart contract public keys can be derived from a single public key, which simplifies key management, and early construction of pre-signatures to enable fast one-round signing of messages. We analyze combinations of these optimization techniques and show for standard non-threshold ECDSA that additive key generation is secure and pre-computation is secure, but combining additive key derivation and pre-computation leads to non-tight security. Fortunately, we can save the combination and tighten security through public re-randomization of the precomputation, which is the solution implemented on the Internet Computer.


  报告人简介  

Jens is a leading cryptographer who has invented pairing-based NIZK proofs, pairing-based SNARKs, and logarithmic size proof systems underpinning Bulletproofs. He got a PhD from Aarhus University, the Chancellor's Award for Postdoctoral Research at UCLA, became Professor of Cryptology at UCL, and has published more than 50 scientific articles.

学术报告|基于加法密钥派生和预签名的门限ECDSA签名算法分析

更多学院动态

欢迎关注



学术报告|基于加法密钥派生和预签名的门限ECDSA签名算法分析


原文始发于微信公众号(浙大网安):学术报告|基于加法密钥派生和预签名的门限ECDSA签名算法分析

  • 左青龙
  • 微信扫一扫
  • weinxin
  • 右白虎
  • 微信扫一扫
  • weinxin
admin
  • 本文由 发表于 2023年9月12日16:41:57
  • 转载请保留本文链接(CN-SEC中文网:感谢原作者辛苦付出):
                   学术报告|基于加法密钥派生和预签名的门限ECDSA签名算法分析https://cn-sec.com/archives/2029736.html

发表评论

匿名网友 填写信息