Author:
Chen Megan,Doerner Jack,Kondi Yashvanth,Lee Eysa,Rosefield Schuyler,Shelat Abhi,Cohen Ran
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference51 articles.
1. Joy Algesheimer, Jan Camenisch, and Victor Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Advances in Cryptology – CRYPTO 2002, pages 417–432, 2002.
2. Elaine Barker. Nist special publication 800-57, part 1, revision 4. https://doi.org/10.6028/NIST.SP.800-57pt1r4, 2016.
3. Michael Ben-Or and Ran El-Yaniv. Resilient-optimal interactive consistency in constant time. Distributed Computing, 16(4):249–262, 2003.
4. Dan Boneh and Matthew K. Franklin. Efficient generation of shared RSA keys. In Advances in Cryptology – CRYPTO 1997, pages 425–439, 1997.
5. Dan Boneh and Matthew K. Franklin. Efficient generation of shared RSA keys. Journal of the ACM, 48(4):702–722, 2001.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献