Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation
暂无分享,去创建一个
[1] Moti Yung,et al. Cryptosystems Robust against "Dynamic Faults" Meet Enterprise Needs for Organizational "Change Control" , 1999, Financial Cryptography.
[2] Shlomi Dolev,et al. Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation , 2011, ICS.
[3] Adi Shamir,et al. How to share a secret , 1979, CACM.
[4] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[5] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[6] Shlomi Dolev,et al. Towards efficient private distributed computation on unbounded input streams , 2012, J. Math. Cryptol..
[7] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[8] Rafail Ostrovsky,et al. Communication-Optimal Proactive Secret Sharing for Dynamic Groups , 2015, ACNS.
[9] Moses D. Liskov,et al. Mobile proactive secret sharing , 2008, PODC '08.
[10] Hugo Krawczyk,et al. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.
[11] Ran Canetti,et al. Maintaining Security in the Presence of Transient Faults , 1994, CRYPTO.
[12] Anna Lysyanskaya,et al. Asynchronous verifiable secret sharing and proactive cryptosystems , 2002, CCS '02.
[13] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[14] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[15] Rafail Ostrovsky,et al. Proactive Secret Sharing with a Dishonest Majority , 2016, SCN.
[16] Michael Backes,et al. Proactive secure message transmission in asynchronous networks , 2003, PODC '03.
[17] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[18] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[19] Rafail Ostrovsky,et al. How to withstand mobile virus attacks, revisited , 2014, PODC '14.
[20] Robbert van Renesse,et al. APSS: proactive secret sharing in asynchronous systems , 2005, TSEC.
[21] Moti Yung,et al. Proactive RSA , 1997, CRYPTO.
[22] Jeannette M. Wing,et al. Verifiable secret redistribution for archive systems , 2002, First International IEEE Security in Storage Workshop, 2002. Proceedings..
[23] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[24] Shlomi Dolev,et al. Swarming secrets , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[25] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[26] Ueli Maurer,et al. A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation , 2013, IACR Cryptol. ePrint Arch..
[27] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[28] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[29] Sushil Jajodia,et al. Moving Target Defense - Creating Asymmetric Uncertainty for Cyber Threats , 2011, Moving Target Defense.
[30] Rafail Ostrovsky,et al. Proactive Secure Multiparty Computation with a Dishonest Majority , 2018, SCN.
[31] Rafail Ostrovsky,et al. How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.