Access the full text.
Sign up today, get DeepDyve free for 14 days.
Craig Gentry, S. Halevi (2011)
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
V. Vaikuntanathan (2011)
Computing Blindfolded: New Developments in Fully Homomorphic Encryption2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Peter Breuer, Jonathan Bowen (2014)
Idea: Towards a Working Fully Homomorphic Crypto-processor - Practice and the Secret Computer
Marten Dijk, Craig Gentry, S. Halevi, V. Vaikuntanathan (2010)
Fully Homomorphic Encryption over the Integers
Jonathan Katz, Yehuda Lindell (2007)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
S. Roy, K. Järvinen, F. Vercauteren, V. Dimitrov, I. Verbauwhede (2015)
Modular Hardware Architecture for Somewhat Homomorphic Function EvaluationIACR Cryptol. ePrint Arch., 2015
K. Lauter, M. Naehrig, V. Vaikuntanathan (2011)
Can homomorphic encryption be practical?IACR Cryptol. ePrint Arch., 2011
Christopher Fletcher, Marten Dijk, S. Devadas (2012)
A secure processor architecture for encrypted computation on untrusted programs
Xiaolin Cao, C. Moore, Máire O’Neill, Neil Hanley, E. O'Sullivan (2014)
High-Speed Fully Homomorphic Encryption Over the Integers
D. Cousins, K. Rohloff, Daniel Sumorok (2017)
Designing an FPGA-Accelerated Homomorphic Encryption Co-ProcessorIEEE Transactions on Emerging Topics in Computing, 5
G. Becker, F. Regazzoni, C. Paar, W. Burleson (2013)
Stealthy Dopant-Level Hardware Trojans
//hcrypt.com//scarab library
Wei Wang, Yin Hu, Lianmu Chen, Xinming Huang, B. Sunar (2012)
Accelerating fully homomorphic encryption using GPU2012 IEEE Conference on High Performance Extreme Computing
Ayantika Chatterjee, M. Kaushal, I. Sengupta (2013)
Accelerating Sorting of Fully Homomorphic Encrypted Data
H. Perl, Michael Brenner, Matthew Smith (2011)
Poster: an implementation of the fully homomorphic smart-vercauteren crypto-system
N. Smart, F. Vercauteren (2010)
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext SizesIACR Cryptol. ePrint Arch., 2009
Vadim Lyubashevsky, Chris Peikert, O. Regev (2010)
On Ideal Lattices and Learning with Errors over RingsIACR Cryptol. ePrint Arch., 2012
Yarkin Doröz, Erdinç Öztürk, B. Sunar (2013)
Evaluating the Hardware Performance of a Million-Bit Multiplier2013 Euromicro Conference on Digital System Design
T. Pöppelmann, M. Naehrig, Andrew Putnam, Adrián Macías (2015)
Accelerating Homomorphic Evaluation on Reconfigurable Hardware
S. Rass, Daniel Slamanig (2013)
Cryptography for Security and Privacy in Cloud Computing
S. Goldwasser, Y. Kalai, R. Popa, V. Vaikuntanathan, N. Zeldovich (2013)
How to Run Turing Machines on Encrypted Data
S. Hauck, William Wilson (1999)
Runlength compression techniques for FPGA configurationsSeventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00375)
A. Silverberg (2013)
Fully Homomorphic Encryption for MathematiciansIACR Cryptol. ePrint Arch., 2013
Wei Wang, Yin Hu, Lianmu Chen, Xinming Huang, B. Sunar (2015)
Exploring the Feasibility of Fully Homomorphic EncryptionIEEE Transactions on Computers, 64
Vadim Lyubashevsky (2012)
Lattice Signatures Without Trapdoors
Mufutau Akinwande (2009)
Advances in Homomorphic CryptosystemsJ. Univers. Comput. Sci., 15
Ronald Rivest, M. Dertouzos (1978)
ON DATA BANKS AND PRIVACY HOMOMORPHISMS
D. Stehlé, Ron Steinfeld (2010)
Faster Fully Homomorphic Encryption
Xiaolin Cao, C. Moore, Máire O’Neill, E. O'Sullivan, Neil Hanley (2013)
Accelerating Fully Homomorphic Encryption over the Integers with Super-size Hardware Multiplier and Modular ReductionIACR Cryptol. ePrint Arch., 2013
S. Roy, Sinha, F. Vercauteren, Jo Vliegen, I. Verbauwhede, Project Report, Sujoy Sinha (2016)
University of Birmingham Hardware assisted fully homomorphic function evaluation and encrypted search
Vadim Lyubashevsky (2008)
Lattice-Based Identification Schemes Secure Under Active Attacks
H. Perl, Yassene Mohammed, Michael Brenner, Matthew Smith (2014)
Privacy/performance trade-off in private search on bio-medical dataFuture Gener. Comput. Syst., 36
Richard Lindner, Chris Peikert (2011)
Better Key Sizes (and Attacks) for LWE-Based EncryptionIACR Cryptol. ePrint Arch., 2010
R. Rivest, A. Shamir, L. Adleman (1978)
A method for obtaining digital signatures and public-key cryptosystemsCommun. ACM, 21
J. Coron, Avradip Mandal, D. Naccache, Mehdi Tibouchi (2011)
Fully Homomorphic Encryption over the Integers with Shorter Public KeysIACR Cryptol. ePrint Arch., 2011
Craig Gentry (2010)
Computing arbitrary functions of encrypted dataCommun. ACM, 53
H. Perl, Yassene Mohammed, Michael Brenner, Matthew Smith (2012)
Fast confidential search for bio-medical data using Bloom filters and Homomorphic Cryptography2012 IEEE 8th International Conference on E-Science
Craig Gentry (2009)
A fully homomorphic encryption scheme
Zvika Brakerski, V. Vaikuntanathan (2014)
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$SIAM J. Comput., 43
Michael Brenner, H. Perl, Matthew Smith (2018)
Practical Applications of Homomorphic Encryption
(2012)
Towards practical homomorphic encryption with efficient public key generation
N. Tsoutsos, M. Maniatakos (2013)
Investigating the Application of One Instruction Set Computing for Encrypted Data Computation
Wei Wang, Xinming Huang (2013)
FPGA implementation of a large-number multiplier for fully homomorphic encryption2013 IEEE International Symposium on Circuits and Systems (ISCAS2013)
Michael Brenner, H. Perl, Matthew Smith (2012)
How Practical is Homomorphically Encrypted Program Execution? An Implementation and Performance Evaluation2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
P. Shor (1994)
Algorithms for quantum computation: discrete logarithms and factoringProceedings 35th Annual Symposium on Foundations of Computer Science
N. Tsoutsos, M. Maniatakos (2014)
HEROIC: Homomorphically EncRypted One Instruction Computer2014 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Joppe Bos, K. Lauter, Jake Loftus, M. Naehrig (2013)
Improved Security for a Ring-Based Fully Homomorphic Encryption SchemeIACR Cryptol. ePrint Arch., 2013
William Gilreath, P. Laplante (2003)
Computer Architecture: A Minimalist Perspective
N. Koblitz, A. Menezes, S. Vanstone (2000)
The State of Elliptic Curve CryptographyDesigns, Codes and Cryptography, 19
Yarkin Doröz, Erdinç Öztürk, B. Sunar (2015)
Accelerating Fully Homomorphic Encryption in HardwareIEEE Transactions on Computers, 64
[As stated by Gosser, “ Securing a computer system has traditionally been a battle of wits: the penetrator tries to find the holes, and the designer tries to close them”. Hence, for any secure program execution, the instruction flow should also be encrypted. However, finding suitable solution to determine the termination point of any encrypted program is still an open challenge. Encrypted termination requires handling of encrypted condition, which is infeasible by existing unencrypted processors. Thus, for outsourcing computations and achieving privacy, designs of processors which operate on encrypted data as well as address are extremely important. This chapter provides some insight on this issue.]
Published: Mar 30, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.