A Formal System for Analysis of Cryptographic Encryption and Their Security Properties

2004 ◽  
pp. 87-112 ◽  
Author(s):  
Ashraf Bhery ◽  
Shigeki Hagihara ◽  
Naoki Yonezaki
Keyword(s):  
Formal System ◽  
Security Properties

Modality and folk psychology

2019 ◽  
Vol 28 (1) ◽  
pp. 19-27
Author(s):  
Ja. O. Petik
Keyword(s):  
Modal Logic ◽  
Brain Activity ◽  
Formal System ◽  
Philosophy Of Logic ◽  
Psychological States ◽  
Formal Systems ◽  
Modern Psychology ◽  
Philosophical Interpretation ◽  
Important Direction

The connection of the modern psychology and formal systems remains an important direction of research. This paper is centered on philosophical problems surrounding relations between mental and logic. Main attention is given to philosophy of logic but certain ideas are introduced that can be incorporated into the practical philosophical logic. The definition and properties of basic modal logic and descending ones which are used in study of mental activity are in view. The defining role of philosophical interpretation of modality for the particular formal system used for research in the field of psychological states of agents is postulated. Different semantics of modal logic are studied. The hypothesis about the connection of research in cognitive psychology (semantics of brain activity) and formal systems connected to research of psychological states is stated.

Data Integrity

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Data Integrity ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Basic Model ◽  
Function Design ◽  
Security Properties ◽  
Different Levels

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.

Hardware Information Flow Tracking

2021 ◽  
Vol 54 (4) ◽  
pp. 1-39
Author(s):  
Wei Hu ◽  
Armaiti Ardeshiricham ◽  
Ryan Kastner
Keyword(s):  
Access Control ◽  
Computer Security ◽  
Information Flow ◽  
Hardware Security ◽  
Computing System ◽  
Security Vulnerabilities ◽  
Information Flow Tracking ◽  
Side Channels ◽  
Security Properties ◽  
Tools And Techniques

Information flow tracking (IFT) is a fundamental computer security technique used to understand how information moves through a computing system. Hardware IFT techniques specifically target security vulnerabilities related to the design, verification, testing, manufacturing, and deployment of hardware circuits. Hardware IFT can detect unintentional design flaws, malicious circuit modifications, timing side channels, access control violations, and other insecure hardware behaviors. This article surveys the area of hardware IFT. We start with a discussion on the basics of IFT, whose foundations were introduced by Denning in the 1970s. Building upon this, we develop a taxonomy for hardware IFT. We use this to classify and differentiate hardware IFT tools and techniques. Finally, we discuss the challenges yet to be resolved. The survey shows that hardware IFT provides a powerful technique for identifying hardware security vulnerabilities, as well as verifying and enforcing hardware security properties.

Publicly auditable conditional blind signatures

2021 ◽  
Vol 29 (2) ◽  
pp. 229-271
Author(s):  
Panagiotis Grontas ◽  
Aris Pagourtzis ◽  
Alexandros Zacharakis ◽  
Bingsheng Zhang
Keyword(s):  
Proof Of Concept ◽  
Equivalence Test ◽  
Zero Knowledge ◽  
Private Key ◽  
Blind Signatures ◽  
Cryptographic Primitive ◽  
Security Properties ◽  
Designated Verifier

This work formalizes Publicly Auditable Conditional Blind Signatures (PACBS), a new cryptographic primitive that allows the verifiable issuance of blind signatures, the validity of which is contingent upon a predicate and decided by a designated verifier. In particular, when a user requests the signing of a message, blinded to protect her privacy, the signer embeds data in the signature that makes it valid if and only if a condition holds. A verifier, identified by a private key, can check the signature and learn the value of the predicate. Auditability mechanisms in the form of non-interactive zero-knowledge proofs are provided, so that a cheating signer cannot issue arbitrary signatures and a cheating verifier cannot ignore the embedded condition. The security properties of this new primitive are defined using cryptographic games. A proof-of-concept construction, based on the Okamoto–Schnorr blind signatures infused with a plaintext equivalence test is presented and its security is analyzed.

Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs

1993 ◽  
Vol 19 (3-4) ◽  
pp. 275-301
Author(s):  
Andrzej Biela
Keyword(s):  
Theorem Proving ◽  
Dynamic Process ◽  
Functional Equations ◽  
Automated Theorem Proving ◽  
Retrieval System ◽  
Formal System ◽  
Dynamic Algorithm ◽  
Algorithmic Logic ◽  
Correctness Of Programs

In this paper we shall introduce a formal system of algorithmic logic which enables us to formulate some problems connected with a retrieval system which provides a comprehensive tool in automated theorem proving of theorems consisting of programs, procedures and functions. The procedures and functions may occur in considered theorems while the program of the above mentioned system is being executed. We can get an answer whether some relations defined by programs hold and we can prove functional equations in a dynamic way by looking for a special set of axioms /assumptions/ during the execution of system. We formulate RS-algorithm which enables us to construct the set of axioms for proving some properties of functions and relations defined by programs. By RS-algorithm we get the dynamic process of proving functional equations and we can answer the question whether some relations defined by programs hold. It enables us to solve some problems concerning the correctness of programs. This system can be used for giving an expert appraisement. We shall provide the major structures and a sketch of an implementation of the above formal system.

scholarly journals Blockchain-Based Solutions for UAV-Assisted Connected Vehicle Networks in Smart Cities: A Review, Open Issues, and Future Perspectives

Telecom ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 108-140
Author(s):  
Paulo Álvares ◽  
Lion Silva ◽  
Naercio Magaia
Keyword(s):  
Traffic Congestion ◽  
Resource Constraints ◽  
Smart Cities ◽  
The Internet ◽  
Connected Vehicle ◽  
Sensitive Data ◽  
Internet Of Vehicles ◽  
Smart Vehicles ◽  
Security Properties ◽  
Vehicle Networks

It had been predicted that by 2020, nearly 26 billion devices would be connected to the Internet, with a big percentage being vehicles. The Internet of Vehicles (IoVa) is a concept that refers to the connection and cooperation of smart vehicles and devices in a network through the generation, transmission, and processing of data that aims at improving traffic congestion, travel time, and comfort, all the while reducing pollution and accidents. However, this transmission of sensitive data (e.g., location) needs to occur with defined security properties to safeguard vehicles and their drivers since attackers could use this data. Blockchain is a fairly recent technology that guarantees trust between nodes through cryptography mechanisms and consensus protocols in distributed, untrustful environments, like IoV networks. Much research has been done in implementing the former in the latter to impressive results, as Blockchain can cover and offer solutions to many IoV problems. However, these implementations have to deal with the challenge of IoV node’s resource constraints since they do not suffice for the computational and energy requirements of traditional Blockchain systems, which is one of the biggest limitations of Blockchain implementations in IoV. Finally, these two technologies can be used to build the foundations for smart cities, enabling new application models and better results for end-users.

Extensions of Elementary Cause-Effect Structures

2021 ◽  
Vol 179 (2) ◽  
pp. 93-111
Author(s):  
Ludwik Czaja
Keyword(s):  
Characteristic Feature ◽  
Petri Nets ◽  
Algebraic System ◽  
Formal System ◽  
Parallel Execution

Cause-effect structures are objects of a formal system devised for modeling, testing and verifying properties of tasks, where parallel execution of actions is the most characteristic feature. This is an algebraic system called a quasi-semiring. In this paper elementary cause-effect structures, a system behaviourally equivalent to 1-safe Petri nets, are extended by the following features: weighted edges, multi-valued nodes having capacities (counterpart of place/transition Petri nets), inhibitors and a model of time. The extensions are accomplished by modifying the notion of state and semantics, but leaving unchanged structure of the quasi-semiring expressions.

Sign in / Sign up

Export Citation Format

Share Document