Artículos relacionados a Provably secure constructions in cryptography: Weak...

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

Nikolenko, Sergey

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

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Biografía del autor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
LAP LAMBERT Academic Publishing
Año de publicación
2011
Idioma
Inglés
ISBN 10 
3843304041
ISBN 13 
9783843304047
Encuadernación
Tapa blanda
Número de páginas
112
Contacto del fabricante
no disponible
Persona responsable
no disponible