Text

Digital signature schemes: general framework and fail-stop signature

---

Contents:

1. Requirements on Digital Signature Scheme
1.1. Brief Survey of Application
1.2. Legal Significance of Signature
1.3. Consequences of the Legal Significances
1.4. Secure Hardware Support
1.5. Relation to Other Types of Schemes
1.6. A Variant: Invisible Signature

2. History of Digital Signature Sechemes
2.1. Classical Cryptography
2.2. Information-Theoritically Secure Symmetric Schemes
2.3. Invention of Digital Signature Schemes
2.4. Intuitively Constructed Digital Signature Schemes
2.5. Problems, Countermeasures, and Emerging Security Notions
2.6. Provably Secure Digital Signature Schemes
2.7. Special Variants

3. Information-Theoritic Security for Signers: Introduction
3.1. Problem with Ordinary Information-Theoritically
3.2. One New Type: Fail-Stop Signature Schemes

4. Terminology
4.1. General Notions
4.2. Probabilities and Probabilistic Functions
4.3. Complexity
4.4. Interaction

5. Properties of Information-Theoritically
5.1. The Main Ideas
5.2. Service
5.3. Structure
5.4. Security

6. Overview of Existing Schemes with Other than Ordinary Security
6.1. Properties
6.2. Possible Applications and Legal Significance
6.3. Improtant Construction Ideas

7. Conventional Definitions of Fail-Stop Signature Schemes and General Reductions
7.1. Definition
7.2. Relations Between Security Properties
7.3. Fail-Stop Signature Schemes with Prekey
7.4. Relation to Ordinary Digital Signature Schemes
7.5. Constructions with Many Risk Bearers

8. Building Blocks
8.1. Some Groups and Number Theory
8.2. Functions with Large Preimage Sets
8.3. Some Efficient Algorithms
8.4. Concrete Cryptologic Assumptions
8.5. Collision-Intractable Function Families

9. Constructions for One Message Block
9.1. Definition of Scheme for Signing Message Blocks
9.2. General Construction Framework
9.3. Implementation Based on the Discrete-Logarithm Assumption
9.4. Implementations Based on the Factoring Assumption
9.5. Complexity Overview

10. Signing Many Long Mesage
10.1. Message Hashing
10.2. Bottom-Up Tree Authentication
10.3. Top-Down Tree Authentication
10.4. Top-Down Tree Authentication with Small Amount of Private Storage
10.5. Discrete-Logarithm Scheme with Shorter Secret Key
10.6. The Case of a Fixed Recipient

11. Lower Bounds
11.1. Information-Theoretic Background
11.2. Random Variables in Fail-Stop Signature Schemes
11.3. Lower Bound on the Secret Random Bits Needed
11.4. Lenght of Signature and Public Keys
11.5. Lower Bounds on Information-Theoritically Secure Signature Schemes
11.6. Comparison
2.2.

---

Availability

Detail Information

Series Title

--

Call Number

005.8 PFI d

Publisher

New York : Springer., 1996

Collation

xvi, 396 hlm.; ilus.; 25 cm

Language

English

ISBN/ISSN

3540615172

Classification

005.8

Content Type

-

Media Type

-

Carrier Type

-

Edition

--

Subject(s)

-

Specific Detail Info

--

Statement of Responsibility

Birgit Pfitzmann

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment