R
Reto Strobl
Researcher at IBM
Publications - 10
Citations - 411
Reto Strobl is an academic researcher from IBM. The author has contributed to research in topics: Asynchronous communication & Secret sharing. The author has an hindex of 6, co-authored 10 publications receiving 371 citations.
Papers
More filters
Proceedings ArticleDOI
Asynchronous verifiable secret sharing and proactive cryptosystems
TL;DR: The first practical verifiable secret sharing protocol for asynchronous networks was proposed in this article, which uses a discrete logarithm-based sharing and uses only a quadratic number of messages in the number of participating servers.
Posted Content
Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems.
TL;DR: The first practical verifiable secret sharing protocol for asynchronous networks was proposed in this paper, which uses a discrete logarithm-based sharing and uses only a quadratic number of messages in the number of participating servers.
Proceedings ArticleDOI
Asynchronous group key exchange with failures
Christian Cachin,Reto Strobl +1 more
TL;DR: This paper proposes the first purely asynchronous group key exchange protocol that tolerates a minority of servers to crash and investigates how to provide forward secrecy with respect to an adversary that may break into some servers and observe their internal state.
Proceedings ArticleDOI
Proactive secure message transmission in asynchronous networks
TL;DR: This work provides a formal model of the system, using the framework for asynchronous reactive systems proposed by Pfitzmann and Waidner, and presents a protocol for proactive message transmission, and proves it secure using the composability property of the framework.
Patent
Method of verifiably sharing a secret in potentially asynchronous networks
TL;DR: In this paper, the authors provided a method for sharing a secret value among n participating network devices via an asynchronous network, where the secret value x being provided by a distributor was derived by deriving by the distributor share values s and sub-share sij of the secret valued x by applying a linear secret sharing scheme and deriving verification values gsij usable for verification of validity of the share value s and the subshare value s?ij?; sending to each participating network device a share message comprising the corresponding subshare sAi, siA, sBi,