A cryptographic scheme for secure cloud computing
暂无分享,去创建一个
[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[2] Francisco Rodríguez Henríquez. De la búsqueda de funciones booleanas con buenas propiedades criptográficas , 2007 .
[3] Craig Gentry,et al. A fully homomorphic encryption scheme , 2009 .
[4] Edward A. Feigenbaum,et al. Switching and Finite Automata Theory: Computer Science Series , 1990 .
[5] Robert H. Deng,et al. Modified Finite Automata Public Key Cryptosystem , 1997, ISW.
[6] James L. Massey,et al. Inverses of Linear Sequential Circuits , 1968, IEEE Transactions on Computers.
[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[8] Ronald L. Rivest,et al. ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .
[9] Craig Gentry,et al. Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.
[10] Bernard P. Zajac. Applied cryptography: Protocols, algorithms, and source code in C , 1994 .
[11] Bruce Schneier,et al. Applied cryptography : protocols, algorithms, and source codein C , 1996 .
[12] Jennifer Seberry,et al. Cryptographic Boolean functions via group Hadamard matrices , 1994, Australas. J Comb..
[13] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..