Provably secure constructions in cryptography: Weak definitions of security and cryptographic constructions that can be proven secure under these definitions - Couverture souple

Nikolenko, Sergey

 
9783843304047: Provably secure constructions in cryptography: Weak definitions of security and cryptographic constructions that can be proven secure under these definitions
Couverture souple
ISBN 10 : 3843304041 ISBN 13 : 9783843304047
Editeur : LAP LAMBERT Academic Publishing, 2011

Synopsis

At present, little can be proven under the definitions of modern cryptography. To prove that a cryptosystem is secure, one would first have to prove that P does not equal NP. This book is devoted to cryptographic constructions that can be proven secure in a weaker sense. We cover three topics in the book. Complete one-way functions are one-way if there are any one-way functions at all. Feebly secure cryptographic primitives can be proven secure in the strongest classical model of computation, namely general circuit complexity, but security guarantees are only constant. Finally, algebraic cryptography provides examples of noncommutative constructions that are secure against provable break, i.e., against an adversary who can present encoding examples for the messages he deciphers.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

At present, little can be proven under the definitions of modern cryptography. To prove that a cryptosystem is secure, one would first have to prove that P does not equal NP. This book is devoted to cryptographic constructions that can be proven secure in a weaker sense. We cover three topics in the book. Complete one-way functions are one-way if there are any one-way functions at all. Feebly secure cryptographic primitives can be proven secure in the strongest classical model of computation, namely general circuit complexity, but security guarantees are only constant. Finally, algebraic cryptography provides examples of noncommutative constructions that are secure against provable break, i.e., against an adversary who can present encoding examples for the messages he deciphers.

Biographie de l'auteur

Dr. Sergey Nikolenko is currently a researcher at the Steklov Mathematical Institute in St. Petersburg, Russia. His interests lie primarily in computer science, including cryptography, theoretical CS, and Bayesian inference.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2011
Langue
anglais
ISBN 10 
3843304041
ISBN 13 
9783843304047
Reliure
Broché
Nombre de pages
112
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne