Asynchronous Perfectly Secure Communication over One-Time Pads-Reference-Cited by-同舟云学术

Asynchronous Perfectly Secure Communication over One-Time Pads

Published:2005 Issue: Volume: Page:216-227
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Di Crescenzo Giovanni,Kiayias Aggelos

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11523468_18

Reference14 articles.

1. Anderson, R., Woll, H.: Algorithms for the Certified Write-All Problem. SIAM Journal on Computing 139(1), 1–16 (1997)

2. Aspnes, J.: Randomized protocols for asynchronous consensus. In: Invited survey paper for Distributed Computing, PODC 20th anniversary issue (2002)

3. Buss, J., Kanellakis, P., Ragde, P., Shvartsman, A.: Parallel Algorithms for Process Failures and Delays. Journal of Algorithms 20(196), 45–86 (1997)

4. De Prisco, R., Mayer, A., Yung, M.: Time-Optimal Message-Efficient Work-Performance in the Presence of Faults. In: Proc. of PODC 1994 (1994)

5. Dwork, C., Halpern, J., Waarts, O.: Performing Work Efficiently in the Presence of Faults. SIAM Journal on Computing 27, 1457–1491 (1998)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. RPM: Additive Stream Ciphers for Lightweight Communication Security;13th International Conference on Security of Information and Networks;2020-11-04

2. The Strong At-Most-Once Problem;Lecture Notes in Computer Science;2012

3. Solving the At-Most-Once Problem with Nearly Optimal Effectiveness;Distributed Computing and Networking;2012

4. At-Most-Once Semantics in Asynchronous Shared Memory;Lecture Notes in Computer Science;2009