scholarly journals Optimization of ProVerif programs for AKE-protocols

2021 ◽  
Vol 33 (5) ◽  
pp. 105-116
Author(s):  
Evgenii Maksimovich Vinarskii ◽  
Alexey Vasilyevich Demakov
Keyword(s):  
Formal Verification ◽  
Formal Methods ◽  
Distinctive Feature ◽  
Formal Specification ◽  
Cryptographic Protocols ◽  
Experimental Results ◽  
Automatic Verification ◽  
Cryptographic Protocol ◽  
Encryption Scheme ◽  
Program Model

Cryptographic protocols are used to establish a secure connection between “honest” agents who communicate strictly in accordance with the rules of the protocol. In order to make sure that the designed cryptographic protocol is cryptographically strong, various software tools are usually used. However, an adequate specification of a cryptographic protocol is usually presented as a set of requirements for the sequences of transmitted messages, including the format of such messages. The fulfillment of all these requirements leads to the fact that the formal specification for a real cryptographic protocol becomes cumbersome, as a result of which it is difficult to analyze it by formal methods. One of such rapidly developing tools for formal verification of cryptographic protocols is ProVerif. A distinctive feature of the ProVerif tool is that with large protocols, it often fails to analyze them, i.e. it can neither prove the security of the protocol nor refute it. In such cases, they resort either to the approximation of the problem, or to equivalent transformations of the program model in the ProVerif language, simplifying the ProVerif model. In this article, we propose a way to simplify the ProVerif specifications for AKE protocols using the El Gamal encryption scheme. Namely, we suggest equivalent transformations that allow us to construct a ProVerif specification that simplifies the analysis of the specification for the ProVerif tool. Experimental results for the Needham-Schroeder and Yahalom cryptoprotocols show that such an approach can be promising for automatic verification of real protocols.

EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS

2006 ◽  
Vol 17 (04) ◽  
pp. 815-832
Author(s):  
IVAN CIBRARIO BERTOLOTTI ◽  
LUCA DURANTE ◽  
RICCARDO SISTO ◽  
ADRIANO VALENZANO
Keyword(s):  
Formal Verification ◽  
Cryptographic Protocols ◽  
Transition System ◽  
Experimental Results ◽  
Verification Problem ◽  
Security Properties ◽  
Universal Quantification ◽  
Equivalence Verification ◽  
Testing Equivalence ◽  
Labelled Transition System

Testing equivalence is a quite powerful way of expressing security properties of cryptographic protocols, but its formal verification is a difficult task, because it is based on universal quantification over contexts. A technique based on state exploration to address this verification problem has previously been presented; it relies on an environment-sensitive labelled transition system (ES-LTS) and on symbolic term representation. This paper shows that such a technique can be enhanced by exploiting symmetries found in the ES-LTS structure. Experimental results show that the proposed enhancement can substantially reduce the size of the ES-LTS and that the technique as a whole compares favorably with respect to related work.

Cryptographic Protocol Verification Based on the Extension Rule

2014 ◽  
Vol 644-650 ◽  
pp. 3181-3184
Author(s):  
Hai Lin
Keyword(s):  
Formal Methods ◽  
Theorem Proving ◽  
Formal Method ◽  
Cryptographic Protocols ◽  
Strong Sense ◽  
Protocol Verification ◽  
Cryptographic Protocol ◽  
Effective Technique ◽  
Extension Rule

The design of cryptographic protocols is error-prone. People have found serious security flaws in major cryptographic protocols. In recent years, people use formal methods to guarantee the correctness of cryptographic protocols in a strong sense. Resolution-based theorem proving is a widely-used formal method, but there are other techniques as well. For example, the extension rule is another technique used to prove things formally. In this paper, we propose to prove the correctness of cryptographic protocols based on the extension rule. We show that this is an effective technique, which can help to find the security flaws in major cryptographic protocols.

scholarly journals New Statistical Randomness Tests Based on Length of Runs

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Ali Doğanaksoy ◽  
Fatih Sulak ◽  
Muhiddin Uğuz ◽  
Okan Şeker ◽  
Ziya Akcengiz
Keyword(s):  
Statistical Tests ◽  
Random Sequence ◽  
Cryptographic Protocols ◽  
Experimental Results ◽  
Security Evaluation ◽  
Random Numbers ◽  
Statistical Distributions ◽  
Cryptographic Algorithm ◽  
Encryption Algorithms ◽  
Randomness Tests

Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic protocols depend on random values. Randomness is measured by statistical tests and hence security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this work we focus on statistical distributions of runs of lengths one, two, and three. Using these distributions we state three new statistical randomness tests. New tests useχ2distribution and, therefore, exact values of probabilities are needed. Probabilities associated runs of lengths one, two, and three are stated. Corresponding probabilities are divided into five subintervals of equal probabilities. Accordingly, three new statistical tests are defined and pseudocodes for these new statistical tests are given. New statistical tests are designed to detect the deviations in the number of runs of various lengths from a random sequence. Together with some other statistical tests, we analyse our tests’ results on outputs of well-known encryption algorithms and on binary expansions ofe,π, and2. Experimental results show the performance and sensitivity of our tests.

scholarly journals Hybrid Encryption Scheme for Hospital Financial Data Based on Noekeon Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Fei Yao
Keyword(s):  
Success Rate ◽  
Hybrid Algorithm ◽  
Research Study ◽  
Financial Data ◽  
Experimental Results ◽  
Encryption Scheme ◽  
Basic Principles ◽  
Hybrid Encryption ◽  
Rsa Algorithm ◽  
Comprehensive Performance

The previous encryption methods of hospital financial data have the problem of overburden. Therefore, a research study on hybrid encryption of hospital financial data based on Noekeon algorithm is proposed. From the basic principles of the Noekeon algorithm and the application and implementation of the Noekeon algorithm, a hybrid encryption scheme for hospital financial data based on the Noekeon algorithm is designed. In order to improve the security of the encryption system, the RSA algorithm is used to encrypt the encrypted content twice. The hybrid algorithm realizes the hybrid encryption of the hospital's financial data. Finally, a hybrid encryption system for hospital financial data based on Noekeon algorithm is designed. Experimental results show that this method has a higher success rate and better comprehensive performance. It not only improves the encryption efficiency of hospital financial data but also enhances the security of hospital financial data, which has greater application value.

scholarly journals A Reliable Time Lock Encryption Scheme For Relatively Weak Computational Resources

2019 ◽  
Vol 8 (2) ◽  
pp. 893-897
Keyword(s):  
Real World ◽  
Experimental Results ◽  
Encryption Scheme ◽  
Paper Briefly ◽  
Prototype Implementation ◽  
Key Escrow ◽  
Computational Overhead ◽  
Mortgage Payment ◽  
Encryption Decryption ◽  
Computational Resources

Time-lock encryption is a type of encryption in which the process is bound by a factor of time that enables previously impossible applications such as secure auctions, mortgage payment, key escrow, or fair multiparty computations. Existing solution approaches of time lock either employ computational overhead to calculate time or use analogues to map the real-world time, hence lacks reliability. We propose a reliable time-lock encryption scheme, where even receivers with relatively weak computational resources can decrypt the cipher after an accurate real-world deadline, without any interaction with the sender. Proposed solution uses time fetched from timeservers over secured https channel for time lock accuracy and strong AES-256 encryption/decryption techniques for reliability. The paper briefly discusses a java based prototype implementation of the proposed approach and the experimental results

Measuring the Progress of a System Development

2014 ◽  
pp. 1415-1439
Author(s):  
Marta (Plaska) Olszewska ◽  
Marina Waldén
Keyword(s):  
Formal Methods ◽  
Design Process ◽  
Formal Specification ◽  
System Development ◽  
Structural Complexity ◽  
Software Systems ◽  
System Construction ◽  
Design Decisions ◽  
And Control

For most of the developers and managers, the structure and the behaviour of software systems represented in a graphical manner is more understandable than a formal specification of a system or than plain code. Our previous work combined the intuitiveness of UML with the development rigour brought by formal methods and created progress diagrams. In progress diagrams, the design decisions within a system refinement chain are assisted by the application of patterns and illustrated in a comprehensible and compact manner. In order to rigorously assess and control the design process, we need to thoroughly monitor it. In this chapter we show how the application of generic refinement patterns is reflected in measurements. We establish measures for the evaluation of the design progress of the system, where the progress diagrams are assessed from the size and structural complexity perspective. Our motivation is to support the system developers and managers in making the design decisions that regard the system construction.

scholarly journals Formal Specification and Automatic Verification of Conditional Commitments

2015 ◽  
Vol 30 (2) ◽  
pp. 36-44 ◽  
Author(s):  
Warda El Kholy ◽  
Mohamed El Menshawy ◽  
Jamal Bentahar ◽  
Hongyang Qu ◽  
Rachida Dssouli
Keyword(s):  
Formal Specification ◽  
Automatic Verification

On Public-Key Encryption Scheme Based on Chebyshev Maps

2011 ◽  
Vol 268-270 ◽  
pp. 1110-1114
Author(s):  
Lin Hua Zhang ◽  
Xiu Li Mao ◽  
Wan Yu Duan
Keyword(s):  
Theoretical Analysis ◽  
Chebyshev Polynomials ◽  
Experimental Results ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Public Key Cryptosystems

Due to the exceptionally desirable properties, Chebyshev polynomials have been recently proposed for designing public key cryptosystems. However, some proposed schemes were pointed out to be insecure and unpractical. In this paper, we analyze their defects, discretize the Chebyshev maps, generalize properties of Chebyshev polynomials and design an improved scheme. Theoretical analysis shows that it possesses higher security than RSA and experimental results shows it can be implemented easily.

Sign in / Sign up

Export Citation Format

Share Document