HORNS: A homomorphic encryption scheme for cloud computing using residue number system

2011 45th Annual Conference on Information Sciences and Systems, CISS 2011

Volumn , Issue , 2011, Pages

  Gomathisankaran, Mahadevan ^a   Tyagi, Akhilesh ^b   Namuduri, Kamesh ^c  

^a Center for Advanced Research and Technology   (United States)

^b Iowa State University   (United States)

^c UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HOMOMORPHIC-ENCRYPTIONS; RESIDUE NUMBER SYSTEM;

CRYPTOGRAPHY; IMAGE QUALITY; INFORMATION SCIENCE; NUMBERING SYSTEMS;

CLOUD COMPUTING;

EID: 79957872924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2011.5766176     Document Type: Conference Paper

References (6)

1. Jean-Claude Bajard, Laurent-Stphane Didier, and Peter Kornerup. An rns montgomery modular multiplication algorithm. IEEE TRANSACTIONS ON COMPUTERS, 47(7):766-776, 1998.
2. Craig Gentry. Computing arbitrary functions of encrypted data. Commun. ACM, 53(3):97-105, 2010.
3. R T Gregory and D W Matula. Base conversion in residue number systems. Residue number system arithmetic: modern applications in digital signal processing, pages 22-30, 1986.
4. Peter L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, April 1985.
5. Michael A Soderstrand, W Kenneth Jenkins, Graham A Jullien, and Fred J Taylor, editors. Residue number system arithmetic: modern applications in digital signal processing. IEEE Press, Piscataway, NJ, USA, 1986.
6. Trusted Computing Group. TPM Main Specification Level 2 Version 1.2, Revision 103.