Namasudra Advances in Computers

1. Auflage 2014
ISBN: 978-0-12-800325-1
Verlag: Elsevier Science & Techn.
Format: EPUB
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, Band Volume 94, 200 Seiten

Reihe: Advances in Computers

Since its first volume in 1960, Advances in Computers has presented detailed coverage of innovations in computer hardware, software, theory, design, and applications. It has also provided contributors with a medium in which they can explore their subjects in greater depth and breadth than journal articles usually allow. As a result, many articles have become standard references that continue to be of significant, lasting value in this rapidly expanding field. - In-depth surveys and tutorials on new computer technology - Well-known authors and researchers in the field - Extensive bibliographies with most chapters - Many of the volumes are devoted to single themes or subfields of computer science

Autoren/Hrsg.

Namasudra, Suyel

Inhaltsverzeichnis

1;Front Cover;1
2;Advances in Computers;4
3;Copyright;5
4;Contents;6
5;Preface;8
6;Chapter One: Comparison of Security Models: Attack Graphs Versus Petri Nets;10
6.1;1. Introduction;11
6.2;2. Static and Dynamic Security Models;12
6.2.1;2.1 Attack Graphs;12
6.2.2;2.2 Stochastic Attack Graphs ;14
6.2.3;2.3 Petri Nets;16
6.2.4;2.4 Stochastic Petri Nets;17
6.3;3. Model-Based Analysis of System Security;18
6.3.1;3.1 Security Analysis Based on Classical Attack Graph Model;19
6.3.1.1;3.1.1 Reachability Analysis;20
6.3.1.2;3.1.2 Minimization Analysis;20
6.3.1.3;3.1.3 Model Checking Analysis;20
6.3.1.4;3.1.4 Attribute Analysis;22
6.3.2;3.2 Security Analysis Based on the Stochastic Attack Graph Model;23
6.3.2.1;3.2.1 State Risk-Level Analysis;23
6.3.2.2;3.2.2 Stochastic Shortest Path Analysis;23
6.4;4. Security Analysis Based on Petri Nets;24
6.4.1;4.1 Security Analysis Based on Classical Petri Nets;24
6.4.1.1;4.1.1 Behavioral Analysis of Petri Nets;25
6.4.2;4.2 Security Analysis Based on Stochastic Petri Nets;29
6.5;5. Conclusions;30
7;Chapter Two: A Survey on Zero-Knowledge Proofs;34
7.1;1. Background and Motivation;35
7.2;2. Introduction;36
7.2.1;2.1 Interactive Proof and Its Properties;36
7.2.2;2.2 A Simple Example;37
7.2.3;2.3 Computational Indistinguishability;38
7.2.4;2.4 One-Way Function;38
7.2.5;2.5 Simulation Paradigm;39
7.2.6;2.6 Definition of ZKP;40
7.2.7;2.7 Witness Indistinguishability;40
7.2.8;2.8 Honest Verifier Versus General Cheating Verifier;41
7.2.9;2.9 Black-Box Simulator Versus Non-Black-Box Simulator;41
7.2.10;2.10 Quality of ZKPs;43
7.3;3. NP Problem and ZKPs;45
7.4;4. ZKP Applications;47
7.4.1;4.1 ZKP for Graph Three Colorability;47
7.4.2;4.2 ZKP for Feige–Fiat–Shamir Identification Scheme;49
7.4.3;4.3 ZKP for GI;50
7.4.4;4.4 ZKP for Hamiltonian Cycle;52
7.4.5;4.5 Another ZKP for Graph Three Colorability;54
7.4.6;4.6 ZKP Sketch for SAT;55
7.4.7;4.7 ZKP for Circuit Computations;57
7.4.8;4.8 ZKP for Exact Cover;59
7.4.9;4.9 ZKP for 0–1 Knapsack;62
7.5;5. Advanced Topics in Composing ZKPs;64
7.5.1;5.1 Composing ZKPs;64
7.5.1.1;5.1.1 The Richardson–Kilian Concurrent ZKP Protocol;68
7.5.1.2;5.1.2 The Improved Concurrent ZKP Protocol;69
7.5.2;5.2 Efficiency Considerations;71
7.5.3;5.3 Knowledge Complexity;74
7.5.4;5.4 Noninteractive Zero Knowledge;74
7.6;6. Conclusion;75
7.7;References;76
8;Chapter Three: Similarity of Private Keyword Search over Encrypted Document Collection;80
8.1;1. Introduction;81
8.2;2. Background and Definitions;83
8.2.1;2.1 Similarity Metric;83
8.2.2;2.2 Searchable Encryption;84
8.2.2.1;2.2.1 Symmetric Searchable Encryption;84
8.2.2.2;2.2.2 Asymmetric Searchable Encryption;85
8.2.2.3;2.2.3 Security Requirements;86
8.2.3;2.3 Terminologies and Other Basic Tools;86
8.3;3. Constructing Similarity Keyword Set;90
8.3.1;3.1 Enumeration Technique;91
8.3.2;3.2 Wildcard-Based Technique;91
8.4;4. Constructing Secure Index;92
8.4.1;4.1 Inverted-Index-Based Secure Index;93
8.4.2;4.2 Symbol-Trie-Based Secure Index;93
8.4.3;4.3 LSH-Based Secure Index;94
8.4.4;4.4 Bed-Tree-Based Secure Index;96
8.4.5;4.5 Bilinear-Based Secure Index;96
8.5;5. Overview of Some Existing Schemes;97
8.5.1;5.1 Symmetric-Key PKS;97
8.5.2;5.2 Verifiable Symmetric-Key PKS;99
8.5.3;5.3 Verifiable Symmetric-Key PKS Using Twin Cloud;101
8.5.4;5.4 LSH-Based PKS;102
8.5.5;5.5 Bed-Tree Multi-PKS;104
8.5.6;5.6 Public-Key PKS;105
8.5.7;5.7 Classification;106
8.6;6. Conclusion;106
9;Chapter Four: Multiobjective Optimization for Software Refactoring and Evolution;112
9.1;1. Introduction;114
9.1.1;1.1 Research Context;114
9.1.2;1.2 Problem Statement;115
9.1.2.1;1.2.1 Automating Defects Detection;116
9.1.2.2;1.2.2 Automating Defects Correction;116
9.1.3;1.3 Proposed Solutions;118
9.2;2. Related Work;120
9.2.1;2.1 Detection of Design Defects;120
9.2.1.1;2.1.1 Manual Approaches;120
9.2.1.2;2.1.2 Symptom-Based Detection;121
9.2.1.3;2.1.3 Metric-Based Approaches;122
9.2.1.4;2.1.4 Probabilistic Approaches;123
9.2.1.5;2.1.5 Machine Learning-Based Approaches;123
9.2.1.6;2.1.6 Visualization-Based Approaches;124
9.2.2;2.2 Correction of Design Defects;125
9.2.2.1;2.2.1 Manual and Semiautomated Approaches;125
9.2.2.2;2.2.2 Meta-Heuristic Search-Based Approaches;127
9.3;3. Proposal;129
9.3.1;3.1 Research Objective;129
9.3.2;3.2 Methodology;130
9.3.2.1;3.2.1 Step 1: Defects Detection;130
9.3.2.2;3.2.2 Step 2: Defects Correction;131
9.4;4. Design Defects Detection;132
9.4.1;4.1 Genetic Algorithm Overview;132
9.4.2;4.2 Genetic Algorithm Adaptation;133
9.4.2.1;4.2.1 Individual Representation;135
9.4.2.2;4.2.2 Generation of an Initial Population;136
9.4.2.3;4.2.3 Selection and Genetic Operators;136
9.4.2.4;4.2.4 Decoding of an Individual;138
9.4.2.5;4.2.5 Evaluation of an Individual;139
9.4.3;4.3 Validation;140
9.4.3.1;4.3.1 Goals and Objectives;140
9.4.3.2;4.3.2 Systems Studied;140
9.4.3.3;4.3.3 Comparative Results;141
9.4.3.4;4.3.4 Discussion;143
9.5;5. Design Defects Correction;145
9.5.1;5.1 Approach Overview;145
9.5.2;5.2 Modeling the Refactoring Process as a Multiobjective Problem;146
9.5.2.1;5.2.1 Quality;146
9.5.2.2;5.2.2 Code Changes;146
9.5.2.3;5.2.3 Similarity with Recorded Code Changes;147
9.5.2.4;5.2.4 Semantic Preservation;147
9.5.3;5.3 NSGA-II for Software Refactoring;153
9.5.3.1;5.3.1 NSGA-II Overview;154
9.5.3.2;5.3.2 NSGA-II Adaptation;154
9.5.4;5.4 Validation;157
9.5.4.1;5.4.1 Research Questions;157
9.5.4.2;5.4.2 Setup;159
9.5.4.3;5.4.3 Algorithms Configuration;161
9.5.4.4;5.4.4 Results;162
9.5.4.5;5.4.5 Discussion;168
9.6;6. Conclusion;170
10;Author Index;178
11;Subject Index;184
12;Contents of Volumes in This Series;188