How to withstand mobile virus attacks, revisited
暂无分享,去创建一个
Rafail Ostrovsky | Karim M. El Defrawy | Joshua Baron | Joshua Lampkins | R. Ostrovsky | Joshua Baron | Joshua Lampkins
[1] Shuhong Gao,et al. A New Algorithm for Decoding Reed-Solomon Codes , 2003 .
[2] Gabriel Bracha,et al. An O(log n) expected rounds randomized byzantine generals protocol , 1987, JACM.
[3] Alexandra Boldyreva,et al. Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme , 2003, Public Key Cryptography.
[4] Robbert van Renesse,et al. APSS: proactive secret sharing in asynchronous systems , 2005, TSEC.
[5] Ran Canetti,et al. Maintaining Security in the Presence of Transient Faults , 1994, CRYPTO.
[6] Anna Lysyanskaya,et al. Asynchronous verifiable secret sharing and proactive cryptosystems , 2002, CCS '02.
[7] Danny Dolev,et al. Century papers at the first quarter-century milestone , 2006, PODC '06.
[8] Abraham Waksman,et al. A Permutation Network , 1968, JACM.
[9] Jörn Müller-Quade,et al. A Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer , 2004, IACR Cryptol. ePrint Arch..
[10] Ueli Maurer,et al. Universally Composable Synchronous Computation , 2013, TCC.
[11] Craig Gentry,et al. Fully Homomorphic Encryption with Polylog Overhead , 2012, EUROCRYPT.
[12] Moti Yung,et al. Adaptive Security for the Additive-Sharing Based Proactive RSA , 2001, Public Key Cryptography.
[13] Jesper Buus Nielsen,et al. On Protocol Security in the Cryptographic Model , 2003 .
[14] Ivan Damgård,et al. Simplified Threshold RSA with Adaptive and Proactive Security , 2006, EUROCRYPT.
[15] Stanislaw Jarecki,et al. Proactive RSA with Non-interactive Signing , 2008, Financial Cryptography.
[16] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[17] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[18] Moti Yung,et al. Optimal-resilience proactive public-key cryptosystems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[19] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[20] V. Benes. Optimal rearrangeable multistage connecting networks , 1964 .
[21] Ivan Damgård,et al. Scalable and Unconditionally Secure Multiparty Computation , 2007, CRYPTO.
[22] Miguel Castro,et al. Proactive recovery in a Byzantine-fault-tolerant system , 2000, OSDI.
[23] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[24] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[25] Jeannette M. Wing,et al. Verifiable secret redistribution for archive systems , 2002, First International IEEE Security in Storage Workshop, 2002. Proceedings..
[26] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[27] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[28] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[29] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[30] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[31] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[32] Rafail Ostrovsky,et al. How To Withstand Mobile Virus Attacks , 1991, PODC 1991.
[33] Rafail Ostrovsky,et al. How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.
[34] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[35] Tal Rabin,et al. A Simplified Approach to Threshold and Proactive RSA , 1998, CRYPTO.
[36] Nitesh Saxena,et al. Further Simplifications in Proactive RSA Signatures , 2005, TCC.
[37] Moti Yung,et al. Proactive RSA , 1997, CRYPTO.
[38] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[39] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[40] Hugo Krawczyk,et al. Adaptive Security for Threshold Cryptosystems , 1999, CRYPTO.
[41] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[42] Adi Shamir,et al. How to share a secret , 1979, CACM.
[43] Matthew K. Franklin,et al. Eavesdropping games: a graph-theoretic approach to privacy in distributed systems , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[44] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[45] Moses D. Liskov,et al. Mobile proactive secret sharing , 2008, PODC '08.
[46] Hugo Krawczyk,et al. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.
[47] Gene Itkis,et al. SiBIR: Signer-Base Intrusion-Resilient Signatures , 2002, CRYPTO.
[48] Rafail Ostrovsky,et al. Cryptography with constant computational overhead , 2008, STOC.