Leveled Fully Homomorphic Signatures From Standard Lattices

doi 10.1145/2746539.2746576
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Fully Homomorphic Encryption Without Modulus Switching From Classical GapSVP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Bootstrappable Identity-Based Fully Homomorphic Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Fully Homomorphic Encryption Over the Integers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Batch Fully Homomorphic Encryption Over the Integers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures From Lattices Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Linearly Homomorphic Signatures Over Binary Fields and New Tools for Lattice-Based Signatures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Fully Leakage-Resilient Signatures

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2012English

Fully Leakage-Resilient Signatures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Confined Guessing: New Signatures From Standard Assumptions

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy