Cantitate/Preț
Produs

Digital Signature Schemes: General Framework and Fail-Stop Signatures: Lecture Notes in Computer Science, cartea 1100

Autor Birgit Pfitzmann
en Limba Engleză Paperback – 12 sep 1996
This book, based on the author's Ph.D. thesis, was selected during the 1995 GI Doctoral Dissertation Competition as the winning thesis in the foundations-of-informatics track.
Securing integrity for digital communications in the age of global electronic information exchange and electronic commerce is vital to democratic societies and a central technical challenge for cryptologists. As core contribution to advancing the state of the art, the author develops the new class of digital fail-stop signatures. This monograph is self-contained regarding the historical background and cryptographic primitives used. For the first time, a general and sophisticated framework is introduced in which innovative fail-stop signatures are systematically presented and evaluated, from theoretical foundations to engineering aspects.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33168 lei

Preț vechi: 41460 lei
-20% Nou

Puncte Express: 498

Preț estimativ în valută:
6350 6610$ 5227£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540615170
ISBN-10: 3540615172
Pagini: 420
Ilustrații: XVI, 404 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Requirements on digital signature schemes.- History of digital signature schemes.- Information-theoretic security for signers: Introduction.- Terminology.- Properties of digital signature schemes.- Overview of existing schemes with other than ordinary security.- Conventional definitions of fail-stop signature schemes and general reductions.- Building blocks.- Constructions for one message block.- Signing many long messages.- Lower bounds.