Trusted computing with addition machines. I

DOI10.1007/S10559-017-9967-XzbMath1416.68069OpenAlexW2756981288MaRDI QIDQ681716

Andrey K. Novokshonov, Anatoly V. Anisimov

Publication date: 13 February 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-017-9967-x

zbMATH Keywords

digital signatureaddition machinehomomorphic cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ Trusted computing with addition machines. II

Cites Work

• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Homomorphic encryption and secure comparison
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Addition Machines
• Fully Homomorphic Encryption over the Integers
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices
• gold-MUSIC: A Variation on MUSIC to Accurately Determine Peaks of the Spectrum
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

This page was built for publication: Trusted computing with addition machines. I