Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/b97182zbMath1122.94361OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307251

Stephen Sorkin, John F. Canny

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97182

zbMATH Keywords

random walkdiscrete logarithmthreshold cryptographydistributed key Generation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

From fairness to full security in multiparty computation ⋮ Aggregatable distributed key generation ⋮ ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability ⋮ Privacy preserving link analysis on dynamic weighted graph

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004