Context Lyubashevsky and Micciancio s Paper Conclusion
63 pages
English

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

Context Lyubashevsky and Micciancio's Paper Conclusion

-

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus
63 pages
English
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus

Description

Context Lyubashevsky and Micciancio's Paper Conclusion Asymptotically Efficient Lattice-Based Digital Signatures [TCC 2008] Vladimir Lyubashevsky Daniele Micciancio M. Tibouchi, Lattice-Based Crypto Mini-Group, 2009-10-14

  • micciancio's paper

  • exist based

  • schemes

  • digital signature

  • secret-key encryption

  • lattice-based crypto


Sujets

Informations

Publié par
Nombre de lectures 30
Langue English

Exrait

Context
Lyubashevsky and Micciancio’s Paper
Asymptotically Efficient Lattice-Based Digital Signatures [TCC 2008]
Vladimir Lyubashevsky
Daniele Micciancio
M. Tibouchi, Lattice-Based Crypto Mini-Group, 2009-10-14
Conclusion
Context
Lyubashevsky and Micciancio’s Paper
Outline
Context Efficiency Gap of Digital Signatures Lamport Signatures and Merkle Trees
Lyubashevsky and Micciancio’s Paper Overview Details
Conclusion
Context
Lyubashevsky and Micciancio’s Paper
Outline
Context Efficiency Gap of Digital Signatures Lamport Signatures and Merkle Trees
Lyubashevsky and Micciancio’s Paper Overview Details
Conclusion
Context
Lyubashevsky and Micciancio’s Paper
Efficiency Gap of Digital Signatures
As has been long known, secure digital signatures exist based on one-way functions, just like MACs and secret-key encryption schemes. However, while symmetric cryptographic constructs are expected to run in time linear in the security parameterk, usual signature schemes have complexity at least Ω(k2).
Conclusion
Context
Lyubashevsky and Micciancio’s Paper
Efficiency Gap of Digital Signatures
As has been long known, secure digital signatures exist based on one-way functions, just like MACs and secret-key encryption schemes. However, while symmetric cryptographic constructs are expected to run in time linear in the security parameterk, usual signature schemes have complexity at least Ω(k2).
Conclusion
Context
Lyubashevsky and Micciancio’s Paper
Outline
Context Efficiency Gap of Digital Signatures Lamport Signatures and Merkle Trees
Lyubashevsky and Micciancio’s Paper Overview Details
Conclusion
  • Accueil Accueil
  • Univers Univers
  • Ebooks Ebooks
  • Livres audio Livres audio
  • Presse Presse
  • BD BD
  • Documents Documents