Efficient proactive secret sharing
暂无分享,去创建一个
[1] Renato Renner,et al. Simple and Tight Bounds for Information Reconciliation and Privacy Amplification , 2005, ASIACRYPT.
[2] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[3] K. Gopinath,et al. G_{its}^2 VSR: An Information Theoretical Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage , 2007 .
[4] Johannes Braun,et al. Long term confidentiality: a survey , 2014, Des. Codes Cryptogr..
[5] Gilles Brassard,et al. Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..
[6] Yuval Ishai,et al. The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.
[7] Stefan Wolf,et al. Unconditional Security in Cryptography , 1998, Lectures on Data Security.
[8] Ueli Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.
[9] Adi Shamir,et al. How to share a secret , 1979, CACM.
[10] Ueli Maurer,et al. Unconditional Security Against Memory-Bounded Adversaries , 1997, CRYPTO.
[11] Ueli Maurer,et al. Unbreakable Keys from Random Noise , 2007 .
[12] Michael O. Rabin. Provably unbreakable hyper-encryption in the limited access model , 2005, IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005..
[13] K. Gopinath,et al. An extended verifiable secret redistribution protocol for archival systems , 2006, First International Conference on Availability, Reliability and Security (ARES'06).
[14] U. Maurer,et al. Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.
[15] K. Tamaki,et al. Performance of Long-Distance Quantum Key Distribution Over 90-km Optical Links Installed in a Field Environment of Tokyo Metropolitan Area , 2014, Journal of Lightwave Technology.
[16] Theo Dimitrakos,et al. Formal Aspects in Security and Trust, Fourth International Workshop, FAST 2006, Hamilton, Ontario, Canada, August 26-27, 2006, Revised Selected Papers , 2007, Formal Aspects in Security and Trust.
[17] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[18] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[19] Yonatan Aumann,et al. Information Theoretically Secure Communication in the Limited Storage Space Model , 1999, CRYPTO.
[20] Tamir Tassa,et al. Hierarchical Threshold Secret Sharing , 2004, Journal of Cryptology.
[21] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[22] Takeo Kanade,et al. Formal Aspects in Security and Trust , 2008, Lecture Notes in Computer Science.
[23] G. S. Vernam,et al. Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.
[24] Ekert,et al. Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.
[25] Jeannette M. Wing,et al. Verifiable secret redistribution for archive systems , 2002, First International IEEE Security in Storage Workshop, 2002. Proceedings..
[26] Guillermo Morales-Luna,et al. Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions With Parameter Optimization , 2008, IEEE Transactions on Information Theory.
[27] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[28] Imre Csiszár,et al. Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.
[29] Moses D. Liskov,et al. MPSS: Mobile Proactive Secret Sharing , 2010, TSEC.
[30] Sushil Jajodia,et al. Redistributing Secret Shares to New Access Structures and Its Applications , 1997 .
[31] Anna Lysyanskaya,et al. Asynchronous verifiable secret sharing and proactive cryptosystems , 2002, CCS '02.
[32] Denise Demirel,et al. How to Securely Prolong the Computational Bindingness of Pedersen Commitments , 2015, IACR Cryptol. ePrint Arch..
[33] Mahmut Kandemir,et al. Securing Disk-Resident Data through Application Level Encryption , 2007 .
[34] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[35] Yonatan Aumann,et al. Everlasting security in the bounded storage model , 2002, IEEE Trans. Inf. Theory.
[36] Robbert van Renesse,et al. APSS: proactive secret sharing in asynchronous systems , 2005, TSEC.
[37] BuchmannJohannes,et al. Integrity, authenticity, non-repudiation, and proof of existence for long-term archiving , 2015 .
[38] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[39] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[40] Hugo Krawczyk,et al. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.