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

Nikolenko, Sergey

 
9783843304047: Provably secure constructions in cryptography: Weak definitions of security and cryptographic constructions that can be proven secure under these definitions
Softcover
ISBN 10: 3843304041 ISBN 13: 9783843304047
Publisher: 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.

"synopsis" may belong to another edition of this title.

About the Author

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.

"About this title" may belong to another edition of this title.

Publisher
LAP LAMBERT Academic Publishing
Publication date
2011
Language
English
ISBN 10 
3843304041
ISBN 13 
9783843304047
Binding
Paperback
Number of pages
112