Advanced Computing and Systems for Security Volume 14 Lecture Notes in Networks and Systems 242 1st Edition Rituparna Chaki (Editor) - The full ebook version is available, download now to explore
Advanced Computing and Systems for Security Volume 14 Lecture Notes in Networks and Systems 242 1st Edition Rituparna Chaki (Editor) - The full ebook version is available, download now to explore
com
https://ebookmeta.com/product/advanced-computing-and-
systems-for-security-volume-14-lecture-notes-in-networks-
and-systems-242-1st-edition-rituparna-chaki-editor/
OR CLICK HERE
DOWLOAD EBOOK
https://ebookmeta.com/product/advanced-computing-and-systems-for-
security-volume-13-1st-edition-rituparna-chaki/
ebookmeta.com
https://ebookmeta.com/product/assessment-of-advanced-solid-state-
lighting-1st-edition-national-research-council/
ebookmeta.com
Economics, 14th Global Edition Michael Parkin
https://ebookmeta.com/product/economics-14th-global-edition-michael-
parkin/
ebookmeta.com
https://ebookmeta.com/product/ise-introduction-to-managerial-
accounting-9e-9th-edition-eric-w-noreen/
ebookmeta.com
https://ebookmeta.com/product/fixer-upper-heart-of-a-wounded-hero-1st-
edition-cassie-mint-2/
ebookmeta.com
https://ebookmeta.com/product/97-things-every-ux-practitioner-should-
know-collective-wisdom-from-the-experts-1st-edition-daniel-berlin/
ebookmeta.com
https://ebookmeta.com/product/empowerment-series-becoming-an-
effective-policy-advocate-8th-edition-bruce-s-jansson/
ebookmeta.com
African Special Economic Zones: Lessons and Investments
from China 1st Edition Bryan Robinson
https://ebookmeta.com/product/african-special-economic-zones-lessons-
and-investments-from-china-1st-edition-bryan-robinson/
ebookmeta.com
Lecture Notes in Networks and Systems 242
Rituparna Chaki
Nabendu Chaki
Agostino Cortesi
Khalid Saeed Editors
Advanced
Computing
and Systems
for Security:
Volume 14
Lecture Notes in Networks and Systems
Volume 242
Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland
Advisory Editors
Fernando Gomide, Department of Computer Engineering and Automation—DCA,
School of Electrical and Computer Engineering—FEEC, University of Campinas—
UNICAMP, São Paulo, Brazil
Okyay Kaynak, Department of Electrical and Electronic Engineering,
Bogazici University, Istanbul, Turkey
Derong Liu, Department of Electrical and Computer Engineering, University
of Illinois at Chicago, Chicago, USA; Institute of Automation, Chinese Academy
of Sciences, Beijing, China
Witold Pedrycz, Department of Electrical and Computer Engineering, University of
Alberta, Alberta, Canada; Systems Research Institute, Polish Academy of
Sciences, Warsaw, Poland
Marios M. Polycarpou, Department of Electrical and Computer Engineering,
KIOS Research Center for Intelligent Systems and Networks, University of Cyprus,
Nicosia, Cyprus
Imre J. Rudas, Óbuda University, Budapest, Hungary
Jun Wang, Department of Computer Science, City University of Hong Kong,
Kowloon, Hong Kong
The series “Lecture Notes in Networks and Systems” publishes the latest
developments in Networks and Systems—quickly, informally and with high quality.
Original research reported in proceedings and post-proceedings represents the core
of LNNS.
Volumes published in LNNS embrace all aspects and subfields of, as well as new
challenges in, Networks and Systems.
The series contains proceedings and edited volumes in systems and networks,
spanning the areas of Cyber-Physical Systems, Autonomous Systems, Sensor
Networks, Control Systems, Energy Systems, Automotive Systems, Biological
Systems, Vehicular Networking and Connected Vehicles, Aerospace Systems,
Automation, Manufacturing, Smart Grids, Nonlinear Systems, Power Systems,
Robotics, Social Systems, Economic Systems and other. Of particular value to both
the contributors and the readership are the short publication timeframe and the
world-wide distribution and exposure which enable both a wide and rapid
dissemination of research output.
The series covers the theory, applications, and perspectives on the state of the art
and future developments relevant to systems and networks, decision making, control,
complex processes and related areas, as embedded in the fields of interdisciplinary
and applied sciences, engineering, computer science, physics, economics, social, and
life sciences, as well as the paradigms and methodologies behind them.
Indexed by SCOPUS, INSPEC, WTI Frankfurt eG, zbMATH, SCImago.
All books published in the series are submitted for consideration in Web of Science.
Advanced Computing
and Systems for Security:
Volume 14
Editors
Rituparna Chaki Nabendu Chaki
University of Calcutta Department of Computer Science
Kolkata, India and Engineering
University of Calcutta
Agostino Cortesi Kolkata, West Bengal, India
Ca Foscari University
Venice, Italy Khalid Saeed
Bialystok University of Technology
Bialystok, Poland
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature
Singapore Pte Ltd. 2021
This work is subject to copyright. All rights are solely and exclusively licensed by the Publisher, whether
the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse
of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and
transmission or information storage and retrieval, electronic adaptation, computer software, or by similar
or dissimilar methodology now known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book
are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or
the editors give a warranty, expressed or implied, with respect to the material contained herein or for any
errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional
claims in published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Preface
This book collects the deeply revised version of papers accepted for oral presentation
at the Eighth International Doctoral Symposium on Applied Computation and Secu-
rity Systems (ACSS 2021). ACSS 2021 took place in Kolkata, India, on April 9–
10, 2021. The Doctoral Symposium was organized by the University of Calcutta in
collaboration with Ca Foscari University of Venice, Italy, and Bialystok University
of Technology, Poland.
This unique symposium is aimed specially to facilitate budding researchers in
pursuing their doctoral degree. Each contributed paper was required to have at least
one enrolled Ph.D. student as one of the authors. This has given an opportunity
to each Ph.D. student to express their innovative ideas and to discuss them with a
qualified scientific community of peers.
Over the years, the overall quality of the papers submitted to ACSS has been
improving dramatically, and their subjects reflect and somehow anticipate the
emerging research trends in the area of applied computation and security. In the
call for papers, the following topics of interest related to Applied Computation have
been listed: Security Systems, Software Engineering, Internet of Things, Artificial
Intelligence, Data Science, Computer Vision, and Algorithms.
The editors are greatly indebted to the members of the international program
committee for sharing their expertise and completing their careful review of the
papers in due time. Their reviews have allowed the authors not only to improve their
articles but also to get new hints toward the completion of their Ph.D. thesis.
The dissemination initiatives from Springer have drawn a large number of high-
quality submissions from scholars primarily but not exclusively from India. ACSS
used a double-blind review process and each paper received at least three reviews
either from the PC members or by external reviewers. The reviewers mainly consid-
ered the technical quality and the originality of each paper. As ACSS is a doctoral
symposium, special emphasis was given to assess the clarity of presentation. The
entire process of paper submission, review, and acceptance process was done online.
After carefully considering the reviews, the Program Committee selected only 27
papers for publication out of 45 submissions.
v
vi Preface
Security
Parallel Simulation of Cyber-Physical-Systems . . . . . . . . . . . . . . . . . . . . . . . 3
Kamal Das, Amit Gurung, and Rajarshi Ray
Attack Detection Scheme Using Deep Learning Approach for IoT . . . . . . 17
Vikash Kumar, Sidra Kalam, Ayan Kumar Das, and Ditipriya Sinha
An Efficient Authentication Scheme for Mobile Online Social
Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Munmun Bhattacharya, Sandip Roy, and Samiran Chattopadhyay
GAN-Based Data Generation Approach for IDS: Evaluation
on Decision Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
Sudhir Kumar Pandey, Vikash Kumar, Ditipriya Sinha, and Ayan Kumar Das
Software Engineering
Conceptualizing Re-configurable Business Process:
A Context-Driven Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
Priyanka Chakraborty and Anirban Sarkar
Dcube N N : Tool for Dynamic Design Discovery from Multi-threaded
Applications Using Neural Sequence Models . . . . . . . . . . . . . . . . . . . . . . . . . 75
Srijoni Majumdar, Nachiketa Chatterjee, Partha Pratim Das,
and Amlan Chakrabarti
Construction of Materialized Views in Non-Binary Data Space . . . . . . . . 93
Santanu Roy, Bibekananda Shit, Soumya Sen, and Agostino Cortesi
Dynamic Prioritization of Software Requirements for Incremental
Software Development . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
Mandira Roy, Novarun Deb, Agostino Cortesi, Rituparna Chaki,
and Nabendu Chaki
vii
viii Contents
Systems Biology
A Framework for Translation and Validation of Digital
Microfluidic Protocols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
Pushpita Roy, Ansuman Banerjee, and Bhargab B. Bhattacharya
Disease-Relevant Gene Selection Using Mean Shift Clustering . . . . . . . . . 151
Srirupa Dasgupta, Sharmistha Bhattacharya, Abhinandan Khan,
Anindya Halder, Goutam Saha, and Rajat Kumar Pal
Multiple Fault Identification and Diagnosis in Cross-Referencing
Digital Microfluidic Biochips . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
Sagarika Chowdhury, Kazi Amrin Kabir, Debasis Dhal,
Rajat Kumar Pal, and Goutam Saha
Brain Tumor Detection: A Comparative Study Among Fast Object
Detection Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
Sunita Roy, Sanchari Sen, Ranjan Mehera, Rajat Kumar Pal,
and Samir Kumar Bandyopadhyay
MicroRNA-Based Cancer Classification Using Feature Selection
Wrapper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
Shib Sankar Bhowmick and Debotosh Bhattacharjee
Editors and Contributors
ix
x Editors and Contributors
Contributors
Rajat Kumar Pal University of Calcutta, Acharya Prafulla Chandra Roy Shiksha
Prangan, Saltlake, Kolkata, India
Srijoni Majumdar Indian Institute of Technology, Kharagpur, West Bengal, India
Ranjan Mehera Business & Solution Consulting, Subex, Inc., Broomfield, CO,
USA
Rajat Kumar Pal Department of Computer Science and Engineering, University
of Calcutta, Kolkata, West Bengal, India
Sudhir Kumar Pandey Lok Nayak Jai Prakash Institute of Technology, Chapra,
Saran, Bihar, India
Partha Pratim Das Indian Institute of Technology, Kharagpur, West Bengal, India
Rajarshi Ray Indian Association for the Cultivation of Science, Kolkata, West
Bengal, India
Mandira Roy University of Calcutta, Kolkata, India
Pushpita Roy Indian Statistical Institute, Kolkata, India;
Calcutta University, Kolkata, India
Sandip Roy Department of Computer Science and Engineering, Asansol Engi-
neering College, Asansol, WB, India
Santanu Roy Future Institute of Engineering and Management, Kolkata, India
Sunita Roy Department of Computer Science and Engineering, University of
Calcutta, Kolkata, West Bengal, India
Goutam Saha Department of Information Technology, North-Eastern Hill Univer-
sity, Umshing Mawkynroh, Shillong, Meghalaya, India
Anirban Sarkar Department of Computer Science and Engineering, National
Institute of Technology, Durgapur, West Bengal, India
Sanchari Sen Department of Computer Science and Engineering, University of
Calcutta, Kolkata, West Bengal, India
Soumya Sen University of Calcutta, Kolkata, India
Bibekananda Shit Future Institute of Engineering and Management, Kolkata, India
Ditipriya Sinha National Institute of Technology Patna, Patna, Bihar, India
Security
Parallel Simulation of
Cyber-Physical-Systems
K. Das (B)
National Institute of Technology Meghalaya, Shillong, Meghalaya, India
e-mail: [email protected]
A. Gurung
Martin Luther Christian University, Shillong, Meghalaya, India
R. Ray
Indian Association for the Cultivation of Science, Kolkata, West Bengal, India
e-mail: [email protected]
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021 3
R. Chaki et al. (eds.), Advanced Computing and Systems for Security: Volume 14,
Lecture Notes in Networks and Systems 242,
https://doi.org/10.1007/978-981-16-4294-4_1
4 K. Das et al.
1 Introduction
benefits over SpaceEx [14] and CORA [2], the modern model checkers and simu-
lators for linear and affine hybrid systems.
Related Works:
Tools like HyLAA [7] and Breach [11] implement numerical simulators for linear
hybrid systems whereas C2E2 [12] is a numerical simulator for linear and non-linear
CPS. These tools, however, focus on methods of approximating reachable states of
HA models using finitely many simulations. Breach can additionally monitor the
robustness satisfaction of metric interval temporal logic (MITL) formulas. SpaceEx
[14] and CORA [2] are verification tools that implement HA simulation engines
that can compute random simulations using numerical ODE solvers. None of these
tools exploits the inherent parallelism in the modern multicore processors to accel-
erate computing simulation trajectories in parallel. This is where we contribute by
implementing a parallel simulation engine as part of the model-checker XSpeed.
We organize the paper as follows. The requisite background is discussed in Sect. 2.
The parallel algorithm to compute simulation trajectories is presented in Sect. 3. We
show the algorithm’s performance and validity evaluation in Sect. 4, and we conclude
in Sect. 5.
2 Preliminaries
Definition 2.1 [18] A hybrid automaton is a 7-tuple (X , G (V, E), Init, Inv, Flow,
Jump, Assign) where
– X = {x1 , x2 , . . . , xn } is a finite set of continuous variables. The number of
variables in the set is called the dimension of the hybrid automaton. The set
Ẋ = {x˙1 , x˙2 , . . . , x˙n } is the set of variables representing the first derivative of
the respective variables in X . Similarly, the set X = {x1 , x2 , . . . , xn } is the set
of primed variables representing the reset values of the respective variables in X
after effectuating a discrete transition.
– G (V, E) is a directed multigraph of a finite automaton with the set of locations V
and the set of transition edges E.
– Init and Inv are labeling functions that assign to each location in V, a predicate
with free variables from X . The predicate assigned to a location by Inv and Init
is called the invariant and initial condition of the location respectively. Jump is a
labeling function that assigns to each transition edge e ∈ E, a predicate with free
variables from X .
– Flow is a labeling function that assigns to each location in V, a predicate with free
variables from X ∪ Ẋ .
– Assign is a labeling function that assigns to each transition edge e ∈ E, a predicate
with free variables from the set X ∪ X .
6 K. Das et al.
The state of an hybrid automaton is a 2-tuple , v, where ∈ V and v ∈ Rn such that
v satisfies the predicate Inv(), i.e., Inv()[X := v] = tr ue, n being the dimension
of the automaton. The state represents the location of the HA and an assignment
of values to the variables of the HA, denoted with vector v. The state of an HA may
change either by a timed transition or by a discrete transition. A timed transition
δ
due to δ passage of time can be represented as , v − → , w such that v, v̇ and
w, ẇ satisfies the flow predicate Flow(), i.e., Flow()[X := v, Ẋ := v̇] = tr ue
and Flow()[X := w, Ẋ := ẇ] = tr ue. Note that in a timed transition, the location
of the state ∈ V remains the same but represents the change in system variables
due to the continuous flow dynamics. A discrete transition can be represented as
e
→ 2 , v , given that ∃e ∈ E from 1 to 2 for some 1 , 2 ∈ V, such that
1 , v −
Jump(e)[X := v] = tr ue, and Assign(e)[X := v, X := v ] = tr ue. We now define
a trajectory of an hybrid automaton.
vi+2 depicts the trajectory in location 1 and 2 due to timed transition, satisfying
Flow(1 ) and Flow(2 ) respectively. The figure shows a discrete transition due to an
edge e from 1 to 2 . Since the end-point vi+1 of the trajectory in 1 satisfies the
Jump(e) predicate, the transition is enabled. The result of taking the transition is an
update of vi+1 to the new vector vi+1 due to the assignments defined in the Assign(e)
predicate. An important point here is that it is not obligatory to effectuate a discrete
jump when the Jump predicate is satisfied since HA has may transition semantics.
In other words, the may transition semantics in HA says that if a state , v is such
that v satisfies Inv() as well as the Jump(e) predicate for some e ∈ E, then there is
a choice to either take a timed transition or take a discrete transition due to e from
the state , v in the HA.
Definition 2.4 A polygonal constraint over the variables in X = {x1 , x2 , . . . , xn } is
of the form A.x ≤ b, where An×n is a real-valued matrix, xn×1 is a column vector
comprising of the variables x1 , x2 , . . . xn and b ∈ Rn is a real-valued column vec-
tor. The vectors v ∈ Rn satisfying a polygonal constraint defines an n-dimensional
polytope.
An HA, modeling a thermostat is shown in Fig. 2. It has two locations, ON and OFF,
to represent the thermostat’s switched-on and switched-off state, respectively. It is a
two-dimensional HA with variables T and time, representing the temperature and
the elapsed time. The invariant T ≥ 60 in OFF location signifies that during the
switched-off state of the thermostat, the temperature can be 60 or above. Similarly
the invariant T ≤ 70 in the ON location signifies that during the switched-on state
of the thermostat, the temperature can be 70 or below. The Flow in the OFF location
is Ṫ = −k2, time˙ = 1 and signifies that the temperature decreases in a constant rate
k2 while the time progresses during the switched-off state of the thermostat. Simi-
larly, during the switched-on state, the temperature increases following the dynamics
Ṫ = k1(70 − T ) while the time progresses (time˙ = 1) as represented with the Flow
predicate. The Jump predicate on the OFF to ON transition is T ≤ 62 indicating that
the transition may take effect only when the temperature of the thermostat is 62 or
8 K. Das et al.
3 Parallel HA Simulation
This section presents our proposed parallel trajectory simulation algorithm. We first
briefly describe the computation of timed and discrete transitions.
Evaluating Timed Transition: Trajectory-states due to time-transitions are com-
puted numerically using an ODE solver [29]. The present-day ODE solvers can simu-
late first-order linear as well as non-linear ODEs very efficiently. We can improve the
trajectory’s precision by choosing smaller time-steps but at the cost of performance
and memory.
Evaluating Discrete Transition: In the may transition semantics of HA, there
may be infinitely many next trajectory-states possible after taking a discrete transi-
tion. This is due to the non-determinism involved in either choosing or not choosing
to take a transition when an HA state satisfies both the Jump and I nv predicates.
In our algorithm, we follow as soon as possible semantics where a discrete tran-
sition is effectuated as soon as the trajectory satisfies a Jump predicate. There are
two numerical problems involved in the implementation: (1) detecting whether a
trajectory-state , x satisfies the Jump() predicate, and (2) computing the next
trajectory-state , x such that Assign(e)[X = x, X = x ] is satisfied. If a Jump
predicate is a hyperplane, then successive trajectory points computed at time-step
δ may cross the guard failing to detect an intersection. To deal with this crossover
detection problem, we convert the predicate from a hyperplane to a half-space [17] in
the region opposite to the region containing the trajectory’s initial point. This ensures
crossover detection. In the case of polygonal predicates other than hyperplanes, the
satisfaction is easily checked from the satisfiability of AX − b ≤ 0. As soon as a
trajectory-state is detected to satisfy Jump(e), for some e, we compute the successor
state following Assign(e). The computation of a simulation trajectory due to timed
transition is shown in Algorithm 1. The algorithm terminates as soon as a successor
state due to a discrete transition is found, or all states in the time-horizon have been
computed.
For a chosen point pt and a given time-horizon T , the algorithm computes a simu-
lation trajectory, T race, consisting of a sequence of trajectory-states. The trajectory-
states are computed using an ODE solver according to the location dynamics, dis-
cretized at a fixed time-step, δ. The data structure pt consists of a field τ that holds
the elapsed time in the simulation. For any T race, the successive pt.τ holds the time
Parallel Simulation of Cyber-Physical-Systems 9
Parallel Algorithm: The inputs to our algorithm are N —the number of random
simulation trajectories to compute, the HA model to simulate, and the time-horizon T
for simulation. Random vectors N pts ⊂ Rn are obtained such that for any v ∈ N pts,
Init()[X := v] = tr ue, for some ∈ V. Our algorithm is motivated by the parallel
BFS implemented in the model checkers XSpeed [15] and Spin [19]. The algorithm
maintains a shared data-structure W ait, a list of states of the HA, from which further
trajectory needs to be generated via timed and/or discrete transitions. We use W ait of
size (N × N ) to randomly distribute the trajectory-states among N available threads
for efficient load balancing. However, simultaneous read and write access must be
controlled with semaphores or locks to avoid a race condition with a shared W ait.
10 K. Das et al.
4 Evaluation
Benchmark Description:
We consider Bouncing-Ball [23], Navigation benchmark [13], Thermostat [3], Heli-
copter Controller [30], Five Dimensional dynamical system [1], Vehicle platoon
[24], Drivetrain [21], and Building [6] benchmarks for evaluation. The Bouncing-
Ball models the motion of a ball under gravity together with bouncing upon hitting
the ground. The navigation-benchmark depicts a moving object in a grid of n × n
partition in a plane. A Thermostat is a model of a temperature controller. The Heli-
Parallel Simulation of Cyber-Physical-Systems 11
5 Conclusion
We present a parallel simulation engine for hybrid automaton models of CPS which
can compute random simulations in parallel on multicore processors. Our simula-
tion engine implements a multi-threaded lock-free algorithm in order to efficiently
Parallel Simulation of Cyber-Physical-Systems 13
Fig. 5 SpaceEx trajectory splits for a single start state in Nav (3)
Acknowledgements Rajarshi Ray gratefully acknowledges financial support from the Science and
Engineering Research Board (SERB) project with file number IMP/2018/000523. Amit Gurung is
grateful to Martin Luther Christian University, Shillong, Meghalaya, for partially supporting the
work under project grant No. Seed-Grant/559/2017-5567.
14 K. Das et al.
References
1. Althoff M (2010) Reachability analysis and its application to the safety assessment of
autonomous cars. PhD thesis, Technische Universität München
2. Althoff M, Grebenyuk D (2016) Implementation of interval arithmetic in cora 2016. In:
ARCH@ CPSWeek, pp 91–105
3. Alur, R.: Principles of cyber-physical systems. MIT Press (2015)
4. Alur R, Courcoubetis C, Henzinger TA, Ho PH (1992) Hybrid automata: an algorithmic
approach to the specification and verification of hybrid systems. In: Hybrid systems. Springer,
pp 209–229
5. Alur R, Dill DL (1994) A theory of timed automata. Theoretical computer science 126(2):183–
235
6. Antoulas AC, Sorensen DC, Gugercin S (2001) A survey of model reduction methods for
large-scale systems. Contemporary Mathematics 280:193–219
7. Bak S, Duggirala PS (2017) Hylaa: a tool for computing simulation-equivalent reachability
for linear systems. In: Proceedings of the 20th international conference on hybrid systems:
computation and control. ACM, pp. 173–178
8. Brand D, Zafiropulo P (1983) On communicating finite-state machines. Journal of the ACM
(JACM) 30(2):323–342
9. Coddington EA, Levinson N (1955) Theory of ordinary differential equations. Tata McGraw-
Hill Education
10. Damm W, Harel D (2001) Lscs: Breathing life into message sequence charts. Formal methods
in system design 19(1):45–80
11. Donze A (2010) Breach: a toolbox for verification and parameter synthesis of hybrid systems.
In: In Computer-aided verification, pp 167–170
12. Duggirala PS, Mitra S, Viswanathan M, Potok M (2015) C2e2: a verification tool for stateflow
models. In: International conference on tools and algorithms for the construction and analysis
of systems. Springer, pp 68–82
13. Fehnker A, Ivancic F (2004) Benchmarks for hybrid systems verification. In: HSCC, vol 4.
Springer, pp 326–341
14. Frehse G, Le Guernic C, Donzé A, Cotton S, Ray R. Lebeltel O, Ripado R, Girard A, Dang
T, Maler O (2011) SpaceEx: scalable verification of hybrid systems. In: Proceedings of CAV.
LNCS, vol 6806. Springer, pp 379–395
15. Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R (2016) Parallel reachability
analysis for hybrid systems. In: 2016 ACM/IEEE international conference on formal methods
and models for system design (MEMOCODE). IEEE, pp 12–22
16. Gurung A, Ray R, Bartocci E, Bogomolov S, Grosu R (2018) Parallel reachability analysis of
hybrid systems in XSpeed. Int J Softw Tools Technol Transf 1–23
17. Hainry E (2008) Reachability in linear dynamical systems. In: Conference on computability
in Europe. Springer, pp 241–250
18. Henzinger TA (2000) The theory of hybrid automata. In: Verification of digital and hybrid
systems. Springer, pp 265–292
19. Holzmann GJ (2012) Parallelizing the SPIN model checker. In: Proceedings of SPIN 2012.
LNCS, vol 7385. Springer, pp 155–171
20. Jensen JC, Chang DH, Lee EA (2011) A model-based design methodology for cyber-physical
systems. In: 2011 7th international wireless communications and mobile computing conference.
IEEE, pp 1666–1671
21. Jin X, Deshmukh JV, Kapinski J, Ueda K, Butts K (2014) Powertrain control verification bench-
mark. In: Proceedings of the 17th international conference on Hybrid systems: computation
and control. ACM, pp. 253–262
22. Lee EA, Seshia SA (2016) Introduction to embedded systems: a cyber-physical systems
approach. MIT Press
23. Lygeros J, Tomlin C, Sastry S (1999) Hybrid systems: modeling, analysis and control. preprint
Parallel Simulation of Cyber-Physical-Systems 15
24. Makhlouf IB, Kowalewski S (2014) Networked cooperative platoon of vehicles for testing
methods and verification tools. In: ARCH@ CPSWeek, pp 37–42
25. Mathworks: Model-Based Design (2020). https://www.mathworks.com/solutions/model-
based-design.html
26. Paterno F (1999) Model-based design and evaluation of interactive applications. Springer Sci-
ence & Business Media
27. Ray R, Gurung A, Das B, Bartocci E, Bogomolov S, Grosu R (2015) Xspeed: accelerating
reachability analysis on multi-core processors. In: Piterman N (ed) Hardware and software:
verification and testing—11th international haifa verification conference, HVC 2015, Haifa,
Israel, November 17-19, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9434.
Springer, pp 3–18. https://doi.org/10.1007/978-3-319-26287-1_1
28. Reisig W (2012) Petri nets: an introduction, vol 4. Springer Science & Business Media
29. Serban R, Hindmarsh AC (2005) Cvodes: the sensitivity-enabled ode solver in sundials. In:
ASME 2005 international design engineering technical conferences and computers and infor-
mation in engineering conference. American Society of Mechanical Engineers, pp 257–269
30. Skogestad S, Postlethwaite I (2005) Multivariable Feedback Control: Analysis and Design.
John Wiley & Sons
Attack Detection Scheme Using Deep
Learning Approach for IoT
Vikash Kumar, Sidra Kalam, Ayan Kumar Das, and Ditipriya Sinha
1 Introduction
V. Kumar · D. Sinha
National Institute of Technology Patna, Patna 800005, India
e-mail: [email protected]
D. Sinha
e-mail: [email protected]
S. Kalam · A. K. Das (B)
Birla Institute of Technology, Mesra, Patna campus, Patna 800015, India
e-mail: [email protected]
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021 17
R. Chaki et al. (eds.), Advanced Computing and Systems for Security: Volume 14,
Lecture Notes in Networks and Systems 242,
https://doi.org/10.1007/978-981-16-4294-4_2
18 V. Kumar et al.
caused the loss of $350M [1]. Traditional security measures cannot be applied to
IoT as they are low power and resource constrained. These issues can be resolved by
implementing fog layer, which is the extension of the cloud computing that enables
computing service to reside at the edge of the network. In fog layer, the deployed IoT
devices are of high capacity in terms of computational power and energy resource.
Thus, the task of Intrusion Detection System can be easily done in this layer, whereas
the low capacity devices of data sensing layer are deployed to sense different events.
This reduces the burden of the IoT as the storage, pre-processing and computation are
shifted to the nearby fog nodes. The security issue of the IoT generates the need for a
reliable Intrusion Detection System (IDS). An IDS is an application that detects the
malicious activity and classifies the data as malicious and benign at host level and at
network level. Network Intrusion Detection System (NIDS) uses network behavior to
detect attack and Host-based Intrusion Detection System (HIDS) uses system activ-
ities for the detection of attack. The proposed scheme will focus on the former one.
Network traffic is analyzed using anomaly detection and misuse detection. Misuse
detection matches the incoming traffic with already stored signatures for detecting
the attack. Database needs to be updated regularly for new types of attack. It cannot
detect an unknown attack on its own. Anomaly detection detects unknown attack
using behavioral analysis. In the proposed scheme, NIDS uses deep learning for the
training and classification of the attack and benign. The working of deep learning
is inspired by the way human brain thinks and takes the decision. It is an advanced
version of machine learning that is comprised of multiple layers. These layers are
used for feature extraction from the raw data. Each layer is trained to transform the
raw data into more intellectual and composite representation. The main motives of
this research are:
• Develop an anomaly-based intrusion detection model using deep learning
approach.
• Evaluation of the model for checking its efficiency.
The remainder of the paper is divided as—Sect. 2 deals with the study of related
field, Sect. 3 explains the overview of deep learning, Sect. 4 describes the proposed
work, Sect. 5 evaluates the performance of the proposed scheme, and the paper is
concluded in Sect. 6 followed by references.
2 Literature Survey
As IoT is nowadays a buzzword for the entire world, there come many barriers
along with it. Security is a major concern as it makes the system vulnerable to
many cyber-attacks. In order to resolve this issue, deep learning is used. Deep
learning has emerged as an advanced technique of machine learning. The tradi-
tional machine learning algorithms are less capable of attack detection as compar-
ative to the deep learning algorithm [2]. Multiple layer deep learning comprises of
multiple hidden layers, which encourages the model to detect the attacks in the IoT
Attack Detection Scheme … 19
network. There are many research works that discuss about the intrusion detection
using deep neural network. Nathan Shone and Tran Nguyen Ngoc use the non-
symmetric deep auto encoder (NDAE) for the intrusion detection [3]. They stacked
NDAEs in order to form deep learning hierarchy to deal with the complicated rela-
tionships between the features. NDAEs are comprised of multiple hidden layers,
which are non-symmetrical to learn the features from unlabeled data. Classification
of network traffic as normal or benign can be easily done by the neural network
concept. One more approach regarding this is Recurrent Neural Network (RNN)
that can also be used for malware detection [4]. Now a day, many new attacks are
attempting to exploit the system. In an attempt to protect the system against the
attack, first, we need to detect the attacks then only it can be prevented. Many deep
learning-based intrusion detection systems are developed [5] for this implementa-
tion. The attacker keeps on changing their methods every time, IoT network needs
an IDS, which should be flexible to deal with these issues. An intelligent intrusion
detection system is developed to detect and classify these unpredictable attacks [6]
in which network-based intrusion detection system (NIDS) and Host-based intrusion
detection system (HIDS) are combined to detect the cyber-attacks more efficiently.
When attacks are not detected for a longer period of time, it will affect the availability
of the system for the end user. It is very important to deal with these attacks in real
time to minimize the loss. An anomaly based intrusion detection system is devel-
oped, which implemented deep learning [7] to deal with these issues. This approach
worked successfully against wormhole attack, black hole attack, sinkhole attack,
DDoS and opportunistic service attack. DDoS attack is mostly common as it can be
easily spread on a larger scale. Restricted Boltzmann machines (RBM) specifically
handle the DDoS attack [8]. RBMs have the ability to learn the complex features in
an unsupervised learning system. In case of supervised learning, deep convolutional
neural network (DCNN) is also used. Hyun Min Song and Jiyoung Woo have also
developed a model, which uses DCNN in the IDS to provide security in Controller
Area Network (CAN) [9]. CAN is basically used to broadcast the information of the
current status of the vehicle. There are many more ways in which malicious activities
can govern the IoT system. It becomes very important to secure it from the various
types of cyber-attacks as it may lead to risk of life. Multiple IDS frameworks based
on deep learning are already in trend as it is successfully detecting the attacks and
simultaneously preventing the system with higher accuracy rate. Table 1 describes
the attacks detected in the existing schemes.
Deep learning is the breakthrough of the machine learning with increased accuracy
as compared with traditional learning algorithms. It is used for feature extraction and
training of the system. It is comprised of multiple consecutive layers that are used to
perform various operations. Each layer is interconnected to one another and output of
the previous layer is fed as an input to the next consecutive layer. Various application
20 V. Kumar et al.
areas of deep learning are vehicle automation, natural language processing, image
processing, medical customer relationship management automation, etc. The most
common form of deep learning algorithm is multi-layer deep network. Activation
function computes the output of the previous layer and bias for the formation of
weighted input for the next layer. In deep learning algorithm, the value of output is
usually is set to either equal to input or less than the input. During feature extraction
in deep model, loss function is optimized to improve the efficiency of the model as
formulated in Eq. (1), which calculates the average of squared difference between
the predicted and actual resultant.
n 2
i=1 χ − χ̂i
Loss = (1)
n
The cumulative loss function for a set of n number of training data is defined in
Eq. (2).
where, l denoted the number of layers and nl represents the number of nodes in each
layer.
Stochastic Gradient Descent method is used to minimize the loss. Error minimiza-
tion is done using weight and activation function as in Eq. (3) where ωij represents
the updated weight of the link connecting ith and jth neuron of two consecutive layers
δε
and δω ij
represents the error gradient with respect to the weight ωij .
δε
ωi j = η (3)
δωi j
Attack Detection Scheme … 21
4 Proposed Work
Fog layer is responsible for the communication between the users and sensor. Attack
detection system is deployed in the fog layer as they are at the edge of the cloud layer
and close to the interacting users. The proposed intrusion detection model is depicted
in Fig. 1. Deep neural network is used in IDS for attack detection, which is better
than other traditional machine learning algorithm. DNN is best suited for resource-
constrained low power IoT devices because of their thin and layered structure. Three
phases of the intrusion detection system that are used in the proposed scheme are
feature extraction, training and decision-making, which is described in the below
subsection.
IDS categorizes the malicious and benign communication on the basis of behavior
of the message. A single message cannot determine the behavior of the message.
Feature of communication cycle needs to be observed for a period of time for deter-
mining the behavior of the message. In a normal communication between a pair
of sender and receiver, rate of message sent and rate of message received must be
similar. If there is a difference between the rate of transmission and reception then
there must be some attack taking place like Denial of service attack, Replay attack,
sinkhole attack, etc. Based on the training, IDS classifies the message as malicious
and benign message. IDS classifies the message as malicious and benign on the
basis of reception rate, transmission rate, IP of source, IP of destination, transmis-
sion mode, duration, information of data value, etc. All these features are selected
4.2 Training
The proposed model consists of five-layer deep learning model, which consists of
one input layer, three hidden layers and one output layer, which classifies the network
traffic as malicious and benign. The first layer consists of 1024 neurons and hidden
layers consist of 768, 512 and 256 neurons, respectively. Feature vector f v is fed
to the Deep Neural Network (DNN) in the first layer and it passes through all the
Attack Detection Scheme … 23
layers. Each hidden layer is connected to the next hidden layer and provides the
filtered output to the next layer using ReLu activation function as defined in Eq. (4).
The output is calculated by the output layer and it uses Softmax activation function
for the generation of output, which is defined in Eq. (5).
x = max(0, z) (4)
∈χi
ρ(χi ) = κ (5)
j=1 ∈χ j
In the training phase, feature vector is fed through the external node to DNN,
which is present at the bottom of the DNN. The weight attached to each neural node
is initialized. As data pass from the DNN layers in each cycle of training, weight
needs to be modified consequently.
4.3 Decision-Making
Once the training phase is done, the system makes the decision regarding the catego-
rization of the network traffic. It, this phase network traffic, is classified as malicious
and benign on the basis of the training provided to the DNN layer.
5 Experimental Results
In this section, the proposed scheme is validated and evaluated. Keras is used for the
implementation of DNN, which is an open source neural network library [4].
5.1 Dataset
KDDCUP99, NSL-KDD, CICIDS, Bot IoT and UNSW-NB15 are the widely used
datasets for the research work of intrusion detection. The proposed scheme has used
the UNSW-NB15 and Bot-IoT dataset, which is available in .csv format for the
purpose of evaluation of the model. UNSW-NB15 has resolved the issues found in
KDDCUP99 and NSL-KDD. UNSW-NB15 dataset is available in two forms. One
consists of 2 million records and the second is a partition of full record dataset, which
consists of 42 features and class is categorized as normal and nine types of attacks.
Detailed analysis of the dataset is described in Table 2.
24 V. Kumar et al.
Bot IoT dataset was created by deploying a real network environment, which
consists of botnet and normal traffic. The dataset consists of various attack details,
which are discussed in Table 3.
The proposed scheme is evaluated using the evaluation metrics such as accuracy,
precision, recall and F-1 score where TP represents true positive, TN represents true
negative, FP represents false positive and FN represents false negative.
Accuracy is defined as the total number of correct prediction of data to the
total number of data instances. It is one of the important factors for evaluating the
performance of any IDS, which is defined in Eq. (6).
TP + TN
Accuracy = (6)
TP + TN + FP + FN
The ratio of correctly predicted positive data and total number of data in the
actual class is called Recall. It basically indicates the number of attacks returned by
the system, which is defined in Eq. (7).
TP
Recall = (7)
TP + FN
Precision is defined as the ratio of correctly predicted positive data and total
predicted positive data. It predicts the number of attacks returned correctly, which is
defined in Eq. (8).
TP
Precision = (8)
TP + FP
The harmonic mean of recall and precision is called F1 score, which reflects the
stability between both of them, which is defined in Eq. (9).
2 ∗ (precision ∗ recall)
F1 score = (9)
precision + recall
Table 4 describes the performance of the system for two classes, namely, Normal
and Attack on UNSW-NB15 dataset for six hidden layers, whereas Table 5 describes
the performance for nine classes on the same dataset for three hidden layers. Table
6 describes the performance of the system for five classes on Bot-IoT dataset and
Table 7 describes the performance for seven class attack subcategories on the same
dataset for three hidden layers. Finally, Fig. 3 compares the accuracy of the proposed
system for both the dataset.
26 V. Kumar et al.
6 Conclusion
In this paper, a network intrusion detection system is proposed for fog assisted IoT
system. The proposed model is implemented using python and extensive evaluation
is performed. The benchmark UNSW-NB15 and Bot IoT dataset is used for the eval-
uation of the model. The experiment shows that DNN is implemented successfully
for the attack detection in fog-assisted IoT. The model is evaluated on the basis of
precision, recall and F1 score and obtained promising results. To evaluate the perfor-
mance, we have followed two test cases: classification of records as normal and attack
with all the features and classified the attack into its categories with all the features.
Attack Detection Scheme … 27
100
80 UNSW NB-15
Accuracy
60
Bot IoT
40
20
0
1 2 3
Number of Hidden Layers
Death of Cato
FOOTNOTES
[119] [Florusd says: “Scipio got off in a ship but, as the enemy
overtook him, he thrust his sword into his bowels; and when
some one asked where he was, he returned this answer: ‘The
general is well.’” Appianf says: “he ran his sword through his
body, and threw himself into the sea.”]
[120] [Says Florusd: “Petreius slew both Juba and himself; and
the half-consumed meats and funeral dishes were mixed with the
blood of a king and a Roman.”]
[121] [Florusd in Roman fashion says: “Hearing of the defeat of
his party, he did not hesitate to die; but even cheerfully, as
became a wise man, hastened his own death.”]
[122] [Sallust’s comparison of Cæsar and Cato should not
mislead the reader as to the importance of the latter, who in fact
exercised little influence on the great events of his age.]
CHAPTER XXV. THE CLOSING SCENES OF
CÆSAR’S LIFE
THE END OF THE AFRICAN WAR
Cæsar settled the affairs of Africa with his usual despatch, and
sailed from Utica on the fourteenth day of April, 46 b.c. On his way
to Italy, he stopped at Caralis, in Sardinia. The aid which the island
had afforded to his adversaries furnished him with a decent pretext
for extorting from the inhabitants large sums of money. At the end
of the same month he again weighed anchor; but the prevalence of
easterly winds drove him repeatedly to shore, and he at last reached
Rome on the twenty-eighth day after his departure from the
Sardinian capital. The reports he received at this time of the revival
of the republican cause in Spain did not give him much uneasiness.
Cneius had been detained by sickness in the Baleares, and the
fugitives from the field of Thapsus had been almost all cut off in
their attempts to reach the point to which their last hopes were
directed. The legionaries who had mutinied against Cassius Longinus
were still either unsatisfied with their treatment under the
commander who had superseded him, or fearful of their general’s
vengeance when a fitting opportunity should arrive. It was from
Cæsar’s own soldiers that the invitation had gone forth to the
republican chiefs to renew the struggle on the soil of Spain. The
spirit of the old commonwealth still survived in many of the towns of
Bætica; promises of support were freely given; but the remnant of
the African armament was contemptible both in numbers and ability.
Of all the haughty nobles who had thronged the tent of Pompey at
Luceria or Thessalonica, not one with a name known to history
remained in arms, except Labienus alone. He indeed had succeeded
in making his escape from Africa, in company with Varus; but the
insurgents had already placed themselves under the command of
Scapula and Aponius, officers of their own, nor would they suffer
themselves to be transferred from them to any other except the son
of the great Pompey. The extent to which the flame of insurrection
had spread was probably unknown at this time to Cæsar. He was
impatient to reap at last the fruit of so much bloodshed, to assume
the post of honour he had won, and to work out the principles and
objects of so many years of anticipation. A distant and contemptible
outbreak might be subdued without meeting it in person.
Accordingly, C. Didius, an officer of no eminent reputation, was sent
with a naval and military force to the succour of Trebonius, whom,
however, he found already expelled from his government by the
growing force of the new movement.
Meanwhile Rome had sunk, during the conqueror’s absence, into a
state of torpid tranquillity. The universal conviction that the dictator’s
power was irresistible had quelled all further heavings of the spirit of
discontent. Dolabella had been gratified with a command in the late
campaign; while others, in whose fidelity and military skill he could
rely, had been left behind to overawe disaffection. The most
illustrious of the nobility having now no occasion to remain at Rome
for the sake of paying court to a jealous ruler, had retired generally
to their country seats; but Cicero seems to have feared giving
occasion for distrust if he withdrew himself from the broad eye of
public observation. He occupied himself, however, in his philosophical
studies, and could rejoice that he had never, like so many of his
contemporaries when plunging into the excitements of political life,
abandoned the literary pursuits common to them in youth. While he
still regarded the contest in Africa with the sentiments of a true
republican, he confessed with a sigh that though the one cause was
assuredly the more just, yet the victory of either would be equally
disastrous. He probably held aloof from the proceedings of the
servile senate, which occupied itself during the months of Cæsar’s
absence in devising new honours for his acceptance. First of all it
decreed the religious ceremony of a thanksgiving of forty days,
being twice the term to which the compliance of popular gratitude
had ever previously extended, and it was by the length of the
observance that the honour was estimated. Next it appointed that
the victor’s triumphal car should be drawn by horses of white, the
sacred colour, and that the number of his attendant lictors should be
doubled. He was to be requested to undertake the office of censor
for three years, under a new title, which should not remind the
citizens too closely of the times of republican liberty, that of
præfectus morum, or regulator of manners. The changes which the
revolutionary storm had effected in the condition of so many of the
citizens justified a resort to the old constitutional resource for
purging the senate of scandalous or impoverished members, and
infusing new blood into its veins.
The most substantial of all these tributes to Cæsar’s ascendency
was the decree by which he was appointed dictator for a period of
ten years; for thus the initiative of legal measures was united in his
hands with the command of the legions both at home and abroad.
Other specious honours, in the taste of the times, were accumulated
upon him. His chair was to be placed between those of the consuls
in the assembly of the senate; he was to preside and give the signal
in the games of the circus; and his figure in ivory was to be borne in
procession among the images of the gods, and laid up in the Capitol,
opposite the seat of Jupiter himself. A statue was to be erected to
him in bronze, standing upon a globe, with the inscription, “Cæsar
the demi-god.” His name was to be engraved on the entablature of
the Capitol, in the place of that of Catulus, its true restorer. The
historian who recounts these honours assures us that many others
besides these were offered; he has only omitted to specify them
because Cæsar did not think fit to accept them. It is difficult to
imagine to what lower depth of obsequiousness the senate could
have descended, or what higher dignities the conqueror would have
rejected.
CÆSAR’S TRIUMPHS
The time had now arrived for the celebration of the Gallic triumph,
which had been so long postponed. In the interval, the imperator’s
victories had been multiplied, and the ranks of his veterans had been
recruited by fresh enlistments; so that every soldier who had shared
in his later perils and successes demanded the reward of
participating in his honours. Cæsar claimed not one, but four
triumphs: the first, for his conquest of the Gauls; the second for his
defeat of Ptolemy; another, for his victory over Pharnaces; and the
last, for the overthrow of Juba. But he carefully avoided all reference
to what were in reality the most brilliant of his achievements. In
Spain and Thessaly he had routed the disciplined legions of his own
countrymen; but their defeat brought no accession of honour or
territory to the republic. The glory it reflected on the victor was
dubious and barren. The four triumphs were celebrated, with
intervals of a few days between each, that the interests of the public
might not pall with satiety. The first procession formed in the
Campus Martius, outside the walls of the city. It defiled through the
triumphal gate at the foot of the Capitoline Hill, and crossed the
deep hollow of the Velabrum and Forum Boarium, on its way to the
Circus Maximus, which occupied the valley between the Palatine and
Aventine. In passing through the Velabrum, the chariot in which the
imperator stood, happened to break down; a mischance which so
affected him that he never afterwards, it is said, ascended a vehicle
without repeating a charm.
The long procession wound round the base of the Palatine,
skirting the Aventine and Cælian hills, to the point where the arch of
Constantine now stands. There it began the ascent of the gentle
slope which separates the basin of the Colosseum from that of the
Roman Forum. It followed the same track which now leads under
the arch of Titus, paved at this day with solid masses of hewn stone,
which may possibly have re-echoed to the tramp of Cæsar’s legions.
Inclining a little to the right at the point where it gained the summit
of the ridge and looked down upon the comitium and rostra, in the
direction of the Capitol, it passed before the spot where the temple
of Julius was afterwards built; thence it skirted the right side of the
Forum, under the arch of Fabius, till it reached a point just beyond
the existing arch of Severus, where the two roads branched off, the
one to the Capitoline temple, the other to the Mamertine prison.
Here it was that Cæsar took the route of triumph to the left, while
Vercingetorix was led away to the right, and strangled in the
subterranean dungeon. The Gallic hero doubtless met with firmness
and dignity the fate to which he had so long been doomed, while his
conqueror was exhibiting a melancholy spectacle of human infirmity,
crawling up the steps of the Capitol on his knees, to avert, by an act
of childish humiliation, the wrath of the avenging Nemesis. The next
instance of similar degradation recorded is that of the emperor
Claudius, who being corpulent and clumsy performed the ungraceful
feat with the support of an arm on either side. The practice was
probably of no unusual occurrence, and was deeply rooted, we may
believe, in ancient and popular prejudices. A remnant of it still exists,
and may be witnessed by the curious, even at the present day, on
the steps of the Ara Cœli and at the Santa Scala of the Lateran.
The days of triumph which succeeded passed over with
uninterrupted good fortune. The populace were gratified with the
sight of the Egyptian princess Arsinoe led as a captive at the
conqueror’s wheels; but she was spared the fate of the Gallic
chieftain out of favour to her sister, or perhaps out of pity to her sex.
The son of the king of Numidia who followed the triumphal car was
also spared, and lived to receive back his father’s crown from
Augustus. Though Cæsar abstained from claiming the title of a
triumph over his countrymen, he did not scruple to parade their
effigies among the shows of the procession. The figures or pictures
of the vanquished chiefs were carried on litters, and represented the
manner of their deaths. Scipio was seen leaping desperately into the
sea; Cato plunging the sword into his own bowels; Juba and Petreius
engaged in mortal duel; Lentulus stabbed by the Egyptian assassin;
Domitius pierced perhaps in the back, in token of his flight. The
figure of Pompey alone was withheld for fear of the commiseration it
might excite among the people whose favourite he had so lately
been. Nor, as it was, were the spectators unmoved. Upon the
unfeeling display of Roman defeat and
disaster they reflected with becoming
sensibility. But the pictures of Achillas and
Pothinus were received with unmingled
acclamations, and loud was the cry of scorn
at the exhibition of Pharnaces flying in
confusion from the field. After all, the most
impressive part of the ceremony must have
been the appearance of the rude veterans
whose long files closed the procession. With
what ignorant wonder must the children of
Gaul and Iberia, of Epirus and Africa, have
gazed at the splendour of the city, of which
the fame resounded in their native cabins!
What contempt must they have felt for the
unarmed multitudes grinning around them!
How reckless must they have been of the
A Sacrificator dignity of the consuls and senators, they
who claimed the license of shouting derisive
songs in the ears of their own commander!
Little did they think that grave historians would sum up their coarse
camp jokes in evidence against the fame of their illustrious leader;
still less did they dream of the new power which the military class
was thenceforth to constitute in the state. Rome in fact was their
own; but it was a secret they were not yet to discover.
The satisfaction of his armed supporters, however, was the first
condition on which the supreme power of the dictator must
henceforth be maintained in the city. It was a matter, indeed, of
hardly less importance to secure the good humour of the urban
population. While the soldiers receive each a donative of twenty
thousand sesterces, the claims of the much larger multitude of the
free citizens were not undervalued severally at four hundred;
especially as they received the additional gratification of one year’s
remission of house rent. It does not appear how this indulgence
differed from that for which Cælius and Dolabella had raised their
commotions; but the dictator had so strenuously resisted every
attempt to set aside the just claims of creditors on all previous
occasions, that it can hardly be doubted that in this case he gave the
landlords compensation from the public treasury. The mass of the
citizens was feasted at a magnificent banquet, at which the Chian
and Falernian wines, the choicest produce of Greece and Italy,
flowed freely from the hogshead, and towards which six thousand
lampreys, the most exquisite delicacy of the Roman epicure, were
furnished by a single breeder. The mighty multitude reclined before
twenty-two thousand tables; each table having its three couches,
and each couch, we may suppose, its three guests; so that the
whole number feasted may have amounted to nearly two hundred
thousand. When Cæsar undertook the functions of his censorship,
the number of recipients of the public distributions of corn was
estimated at 320,000. Upon a scrutiny into their claims as genuine
and resident citizens, he was enabled to strike off as many as
150,000 from this list. Adding to the remainder the senators and
knights, and the few wealthy individuals who might have scorned to
partake of a state provision, the sum will correspond pretty
accurately with the number of the imperial guests as above
computed.
The public shows with which these gratifications were
accompanied were carried out on a scale of greater magnificence
than even those recently exhibited by Pompey. There was nothing in
which the magistrates of the republic vied more ostentatiously with
one another than in the number of wild beasts and gladiators which
they brought into the arena. The natural taste of the Italian people
for shows and mummery degenerated more and more into an
appetite for blood; but in this, as in every other respect, it was
Cæsar’s ambition to outdo his predecessors, and the extraordinary
ferocity and carnage of the exhibitions which he complacently
witnessed excited a shudder even in the brutal multitude. The
combatants in the games of the Circus were either professional
gladiators, who sold their services for a certain term of years, or
captives taken in war, or lastly public criminals. But Cæsar was,
perhaps, the first to encourage private citizens to make an exhibition
of their skill and valour in these mortal combats. He allowed several
men of equestrian rank, and one the son of a prætor, to demean
themselves in the eyes of their countrymen by this exposure to the
public gaze. It was only when a senator named Fulvius Setinus
asked permission thus to prostitute his dignity, that the dictator was
at last roused to restrain the growing degradation.
If the people of Rome were shocked at the bloodshed which they
were invited to applaud, it seems that they were offended also at
the vast sums which were lavished on these ostentatious spectacles.
They would have preferred, perhaps, that the donative to
themselves should have been greater, and the soldiers even
exhibited symptoms of discontent and mutiny in consequence. No
instance of Cæsar’s profuse expenditure excited greater admiration
than his stretching a silken awning over the heads of the spectators
in the Circus. This beautiful material was brought only from the
farthest extremity of India, and was extremely rare and precious at
Rome at that time. Three centuries later it was still so costly that a
Roman emperor forbade his wife the luxury of a dress of the finest
silk unmixed with a baser fabric. But a more permanent and worthy
object of imperial expenditure was the gorgeous Forum of which
Cæsar had long since laid the foundation with the spoils of his Gallic
Wars. Between the old Roman Forum and the foot of the Quirinal, he
caused a large space to be enclosed with rows of marble corridors,
connecting in one suite halls of justice, chambers of commerce, and
arcades for public recreation. In the centre was erected a temple to
Venus the ancestress, the patroness for whom Cæsar had woven a
breastplate of British pearls, and whose name he had used as his
watchword on the days of his greatest victories. He now completed
the series of his triumphal shows by the dedication of this favourite
work. It remained for centuries a conspicuous monument of the
fame and magnificence of the first of the Cæsars. His successors
were proud to cluster new arches and columns by its side, and
bestowed their names upon the edifices they erected in connection
with it. Finally, Trajan cut through the elevated ridge which united
the Capitoline with the Quirinal, and impeded the further extension
of the imperial forums. He filled the hollow with a new range of
buildings, occupying as much ground as the united works of his
predecessors in this quarter. The depth of his excavation is indicated,
it is said, by the height of the pillar which bears his name.