Context Lyubashevsky and Micciancio's Paper Conclusion

icon

63

pages

icon

English

icon

Documents

Écrit par

Publié par

Lire un extrait
Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Découvre YouScribe et accède à tout notre catalogue !

Je m'inscris

Découvre YouScribe et accède à tout notre catalogue !

Je m'inscris
icon

63

pages

icon

English

icon

Documents

Lire un extrait
Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

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


Voir icon arrow

Publié par

Langue

English

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
Voir icon more
Alternate Text