Trusted computing with addition machines. I

DOI10.1007/S10559-017-9967-XMaRDI QIDQ681716zbMATH OpenOpenAlexFDO

Authors A. 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)

Recommendations

• Trusted computing with addition machines. II
• scientific article; zbMATH DE number 2146561
• scientific article; zbMATH DE number 2127501
• Circuits resilient to additive attacks with applications to secure computation
• An improved cryptology mechanism of trusted computing platform

Cites work

• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Addition Machines
• Efficient fully homomorphic encryption from (standard) LWE
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption and secure comparison
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• gold-MUSIC: A Variation on MUSIC to Accurately Determine Peaks of the Spectrum

Cited in

(5)

• Trusted computing with addition machines. II
• Performance analysis of ``addition machines
• Addition machines, automatic functions and open problems of Floyd and Knuth
• An Architecture for Provably Secure Computation
• Coded circuit for trusted computing: towards dynamic integrity measurement

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681716)