• DocumentCode
    2452917
  • Title

    LWE-based identification schemes

  • Author

    Silva, Rosemberg ; de A Campello, A.C. ; Dahab, Ricardo

  • Author_Institution
    Inst. of Comput., Univ. of Campinas, Sao Paulo, Brazil
  • fYear
    2011
  • fDate
    16-20 Oct. 2011
  • Firstpage
    292
  • Lastpage
    296
  • Abstract
    Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their performance and security. We also highlight the design choices that make our solution of both theoretical and practical interest.
  • Keywords
    cryptography; learning (artificial intelligence); LWE-based identification schemes; average-case reductions; cryptography; learning with errors; worst-case reductions; zero-knowledge identification scheme; Computer science; Conferences; Cryptography; Information theory; Lattices; Protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop (ITW), 2011 IEEE
  • Conference_Location
    Paraty
  • Print_ISBN
    978-1-4577-0438-3
  • Type

    conf

  • DOI
    10.1109/ITW.2011.6089439
  • Filename
    6089439
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2452917