Trusted computing with addition machines. II

DOI10.1007/s10559-018-0002-7zbMath1416.68068OpenAlexW4232725094MaRDI QIDQ1745689

Anatoly V. Anisimov, Andrey K. Novokshonov

Publication date: 18 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-018-0002-7

zbMATH Keywords

digital signatureaddition machinehomomorphic cryptographyverifiable computing

Mathematics Subject Classification ID

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

Related Items (1)

Addition machines, automatic functions and open problems of Floyd and Knuth

Uses Software

• Pinocchio
• Python
• SNARKs for C

Cites Work

• Unnamed Item
• Unnamed Item
• Trusted computing with addition machines. I
• Linearly homomorphic structure-preserving signatures and their applications
• Practical verified computation with streaming interactive proofs
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Fully Homomorphic Message Authenticators
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Homomorphic Signatures for Polynomial Functions
• Constant-Size Commitments to Polynomials and Their Applications
• Addition Machines
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Signatures of Correct Computation
• Practical Homomorphic MACs for Arithmetic Circuits
• Optimal Verification of Operations on Dynamic Sets
• Verifiable Delegation of Computation over Large Datasets
• Two Protocols for Delegation of Computation
• Verifiable Computation on Outsourced Encrypted Data

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