Conference paper Open Access

A Framework for Efficient Lattice-Based DAA

Chen, L.; Kassem, N.; Lehmann, A.; Lyubashevsky, V.


Citation Style Language JSON Export

{
  "DOI": "10.1145/3338511.3357349", 
  "language": "eng", 
  "title": "A Framework for Efficient Lattice-Based DAA", 
  "issued": {
    "date-parts": [
      [
        2020, 
        9, 
        7
      ]
    ]
  }, 
  "abstract": "<p>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 schemes.</p>", 
  "author": [
    {
      "family": "Chen, L."
    }, 
    {
      "family": "Kassem, N."
    }, 
    {
      "family": "Lehmann, A."
    }, 
    {
      "family": "Lyubashevsky, V."
    }
  ], 
  "id": "4017181", 
  "event-place": "London, UK", 
  "type": "paper-conference", 
  "event": "Workshop on Cyber-Security Arms Race (CYSARM 2019)"
}
40
50
views
downloads
Views 40
Downloads 50
Data volume 43.5 MB
Unique views 39
Unique downloads 48

Share

Cite as