publication . Conference object . 2020

A Framework for Efficient Lattice-Based DAA

Liqun Chen; Nada El Kassem; Anja Lehmann; Vadim Lyubashevsky;
Open Access English
  • Published: 07 Sep 2020
  • Publisher: ACM Press
Currently standardized Direct Anonymous Attestation (DAA) schemes have their security based on the factoring and the discrete logarithm problems, and are therefore insecure against quantum attackers. This paper presents a quantum-safe lattice-based Direct Anonymous Attestation protocol that can be suitable for inclusion in a future quantum-resistant TPM. The security of our proposed scheme is proved in the Universal Composability (UC) model under the assumed hardness of the Ring-SIS, Ring-LWE, and NTRU problems. The signature size of our proposed DAA scheme is around 2MB, which is (at least) two orders of magnitude smaller compared to existing post-quantum DAA s...
Persistent Identifiers
arXiv: Computer Science::Cryptography and Security
free text keywords: Factoring, Quantum, Universal composability, Order of magnitude, NTRU, Lattice (order), Discrete logarithm, Computer science, Theoretical computer science, Direct Anonymous Attestation
Funded by
EC| FutureTPM
Future Proofing the Connected World: A Quantum-Resistant Trusted Platform Module
  • Funder: European Commission (EC)
  • Project Code: 779391
  • Funding stream: H2020 | RIA
Validated by funder
Any information missing or wrong?Report an Issue