Paper 2024/972
Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity
Abstract
We study the problem of implementing unconditionally secure reliable and private communication (and hence secure computation) in dynamic incomplete networks.
Our model assumes that the network is always
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- dynamic graphsreliable communicationprivate communicationsecret sharing
- Contact author(s)
-
ivan @ cs au dk
d ravi @ uva nl
lance roy @ cs au dk
dt @ concordium com
sophia yakoubov @ cs au dk - History
- 2024-06-17: approved
- 2024-06-16: received
- See all versions
- Short URL
- https://ia.cr/2024/972
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/972, author = {Ivan Damgård and Divya Ravi and Lawrence Roy and Daniel Tschudi and Sophia Yakoubov}, title = {Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/972}, year = {2024}, url = {https://eprint.iacr.org/2024/972} }