Verifiable Composition of Signature and Encryption A Comprehensive Study of the Design Paradigms 1st Edition by Laila El Aimani 3319681122 9783319681122

Verifiable Composition of Signature and Encryption A Comprehensive Study of the Design Paradigms 1st Edition by Laila El Aimani – Ebook PDF Instant Download/DeliveryISBN:  3319681122, 9783319681122 

Full download Verifiable Composition of Signature and Encryption A Comprehensive Study of the Design Paradigms 1st Edition after payment.

Product details:

ISBN-10 :  3319681122 

ISBN-13 :  9783319681122

Author: Laila El Aimani 

This monograph gives a thorough treatment of the celebrated compositions of signature and encryption that allow for verifiability, that is, to efficiently prove properties about the encrypted data. This study is provided in the context of two cryptographic primitives: (1) designated confirmer signatures, an opaque signature which was introduced to control the proliferation of certified copies of documents, and (2) signcryption, a primitive that offers privacy and authenticity at once in an efficient way. This book is a useful resource to researchers in cryptology and information security, graduate and PhD students, and security professionals.

Verifiable Composition of Signature and Encryption A Comprehensive Study of the Design Paradigms 1st Table of contents:

Part I Background
1 Preliminaries
1.1 Cryptographic Primitives
1.1.1 Digital Signatures
1.1.2 Public-Key Encryption (PKE)
1.1.3 Key/Data Encapsulation Mechanisms
1.1.3.1 Key Encapsulation Mechanisms (KEM)
1.1.3.2 Data Encapsulation Mechanisms (DEM)
1.1.3.3 The Hybrid Encryption Paradigm
1.1.4 Tag-Based Encryption (TBE)
1.1.4.1 Tag-Based KEMs
1.1.5 Commitment Schemes
1.2 Number-Theoretic Problems
1.2.1 Factoring-Related Problems
1.2.2 Discrete-Log-Related Problems
1.3 Reductionist Security
1.3.1 Cryptographic Reductions
1.3.2 Proof Models
1.3.3 Meta-reductions in Cryptography
1.4 Cryptographic Proof Systems
1.4.1 Interactive Proofs
1.4.2 Zero-Knowledge (ZK)
1.4.3 Protocols
1.4.4 Non-interactive Proofs
References
2 Case-Study Primitives
2.1 Convertible Designated-Confirmer Signatures (CDCS)
2.1.1 Motivation
2.1.2 Syntax
2.1.3 Security Model for CDCS
2.1.3.1 Completeness
2.1.3.2 Soundness
2.1.3.3 Non-transferability
2.1.3.4 Unforgeability
2.1.3.5 Invisibility
2.2 Signcryption
2.2.1 Motivation and Challenges
2.2.2 Syntax
2.2.3 Security Model
References
Part II The “Sign_then_Encrypt” (StE) Paradigm
3 Analysis of StE
3.1 StE for Confirmer Signatures
3.1.1 The StE Paradigm
3.1.2 Other Variants
3.2 The Exact Unforgeability of StE Constructions
3.2.1 Roadmap for the Rest of the Chapter
3.3 A Breach in Invisibility with Homomorphic Encryption
3.4 Impossibility Results for Key-Preserving Reductions
3.4.1 Insufficiency of OW-CCA Secure Encryption
3.4.2 Insufficiency of NM-CPA Secure Encryption
3.4.3 Putting All Together
3.5 Extension to Arbitrary Reductions
3.6 Analysis of Damgård-Pedersen’s Undeniable Signatures
3.7 Sufficiency of IND-PCA Secure Encryption
References
4 An Efficient Variant of StE
4.1 The New StE
4.1.1 Construction
4.1.2 Security Analysis
4.2 Practical Realizations
4.2.1 The Class 0=S0.50toheight0.450toheight0.500 0=S0.50toheight0.450toheight0.500 0=S0.50toheight0
4.2.2 The Class E of Encryption Schemes
4.2.3 Confirmation/Denial Protocols
4.3 Further Enhancements
4.3.1 Reducing the Soundness Error
4.3.2 Online Non-transferability
4.4 Performance of the New StE
References
Part III The “Commit_then_Encrypt_and_Sign” (CtEaS) Paradigm
5 Analysis of CtEaS
5.1 CtEaS for Confirmer Signatures
5.2 The Exact Invisibility of CtEaS
5.2.1 Impossibility Results
5.2.1.1 Deficiency of Homomorphic Encryption
5.2.1.2 Insufficiency of OW-CCA Secure Encryption
5.2.1.3 Insufficiency of NM-CPA Secure Encryption
5.2.2 Sufficiency of IND-PCA Secure Encryption
References
6 CtEtS: An Efficient Variant of CtEaS
6.1 Commit_then_Encrypt_then_Sign: CtEtS
6.1.1 The Construction
6.1.2 Security Analysis
6.1.3 Practical Instantiations
6.1.3.1 The Class C of Commitments
6.1.3.2 Confirmation/Denial Protocols
6.2 The “Encrypt_then_Sign” (EtS) Paradigm
6.2.1 Security Analysis
6.2.2 Confirmation/Denial Protocols
6.2.3 Selective Conversion
References
Part IV New Paradigms
7 EtStE: A New Paradigm for Verifiable Signcryption
7.1 Shortcomings of the Classical Paradigms
7.1.1 Review of the Classical Paradigms
7.1.2 Deficiencies of the New StE and CtEtS Paradigms
7.2 EtStE: A New Paradigm for Efficient Verifiable Signcryption
7.2.1 The Construction
7.2.2 Security Analysis
7.2.3 Practical Instantiations
References
8 Multi-User Security
8.1 Motivation and Definition
8.1.1 Formal Security Model
8.1.2 Extension to Multi-User Security
8.2 New Paradigms
8.2.1 Security Analysis
8.2.2 Performance
References
9 Insider Privacy
9.1 The CHK Transform
9.1.1 The CHK Transform for PKE
9.1.2 A CHK-Like Transform for TBE
9.2 New Paradigms with Insider Privacy
9.2.1 Constructions for Confirmer Signatures
9.2.2 Constructions for Verifiable Signcryption
9.2.3 Multi-User Security
9.2.4 Performance
References
10 Wrap-Up

People also search for Verifiable Composition of Signature and Encryption A Comprehensive Study of the Design Paradigms 1st:

verification of signature form
    
verification of signature
    
verifiable electronic signature
    
verifiable digital signature
    
verifiable computation

Tags: Verifiable Composition, Signature, Encryption, Comprehensive Study, the Design Paradigm, Laila El Aimani