Permanent Reencryption: How to Survive Generations of Cryptanalysts to Come
暂无分享,去创建一个
Paulo Veríssimo | Marcus Völp | Francisco Liberal Rocha | Jeremie Decouchant | Jiangshan Yu | P. Veríssimo | Jiangshan Yu | Jérémie Decouchant | M. Völp | F. Rocha
[1] Dennis J. Kucinich,et al. Committee on Oversight and Government Reform , 2012 .
[2] Robbert van Renesse,et al. APSS: proactive secret sharing in asynchronous systems , 2005, TSEC.
[3] Sushil Jajodia,et al. Redistributing Secret Shares to New Access Structures and Its Applications , 1997 .
[4] Anna Lysyanskaya,et al. Asynchronous verifiable secret sharing and proactive cryptosystems , 2002, CCS '02.
[5] Paulo Veríssimo,et al. Proactive resilience through architectural hybridization , 2006, SAC.
[6] Hugo Krawczyk,et al. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.
[7] Craig Gentry,et al. A fully homomorphic encryption scheme , 2009 .
[8] K. Gopinath,et al. G_{its}^2 VSR: An Information Theoretical Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage , 2007 .
[10] Michael Backes,et al. Simulating the Large-Scale Erosion of Genomic Privacy Over Time , 2018, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[11] Mark Ryan,et al. Authenticating Compromisable Storage Systems , 2017, 2017 IEEE Trustcom/BigDataSE/ICESS.
[12] Mahmut Kandemir,et al. Securing Disk-Resident Data through Application Level Encryption , 2007 .
[13] Jeannette M. Wing,et al. Verifiable secret redistribution for archive systems , 2002, First International IEEE Security in Storage Workshop, 2002. Proceedings..
[14] Adi Shamir,et al. How to share a secret , 1979, CACM.
[15] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.