BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.6.10//EN
X-ORIGINAL-URL:https://fintechacademy.cs.hku.hk/
X-WR-CALNAME:FinTech Academy
X-WR-CALDESC:HKU
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-687cb95f9d89142b67e41ab640c0a002@fintechacademy.cs.hku.hk
DTSTART:20230922T080000Z
DTEND:20230922T090000Z
DTSTAMP:20230915T013500Z
CREATED:20230915
LAST-MODIFIED:20231003
PRIORITY:5
SEQUENCE:2
TRANSP:OPAQUE
SUMMARY:Research Seminar Series –  An analysis of ECDSA signatures with additive key derivation and presignatures motivated  by a threshold ECDSA signing service
DESCRIPTION:\nHKU-SCF FinTech Academy, Cyberport ( https://cyberport.hk/en ), and the DFINITY Foundation ( https://dfinity.org/ ) are pleased to co-organize this research seminar featuring Jens Groth as the speaker.  Jens serves as the Principal Researcher at the DFINITY Foundation.\nDate/Time:  22 September 2023 (Fri), 4:00 – 5:00 pm\nVenue:  Innovation Wing Two, HKU\nMode:  Face-to-face\nTarget participants:  Academic and research related members\nRegistration: Required (By invitation only)\nAbstract of the seminar\nIn 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.\nSpeaker: Jens Groth\nPrincipal Researcher, DFINITY Foundation\n\nJens is a leading cryptographer who has invented pairing-based NIZK proofs ( https://link.springer.com/chapter/10.1007%2F11761679_21 ), pairing-based SNARKs ( https://link.springer.com/chapter/10.1007%2F978-3-642-17373-8_19 ), and logarithmic size proof systems ( https://link.springer.com/chapter/10.1007%2F978-3-642-17373-8_19 )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 ( https://scholar.google.com/citations?user=5w0Y9JUAAAAJ&hl=en&oi=ao ).\nShould you have any queries, please contact fintechacademy@cs.hku.hk ( mailto:fintechacademy@cs.hku.hk ).\n
URL:https://fintechacademy.cs.hku.hk/events/research-seminar-series-an-analysis-of-ecdsa-signatures-with-additive-key-derivation-and-presignatures-motivated-by-a-threshold-ecdsa-signing-service/
END:VEVENT
END:VCALENDAR