Results 1  10
of
351
Machinechecked security proofs of cryptographic signature schemes
 In Proceedings of ESORICS’05, volume 3xxx of Lecture Notes in Computer Science
, 2005
"... Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e. the hypothesis that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing t ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
the key. A model that does not require the perfect cryptography assumption is the generic model and the random oracle model. These models provide nonstandard computational models in which one may reason about the computational cost of breaking a cryptographic scheme. Using the machinechecked account
A MachineChecked Formalization of the Random Oracle Model
 in &quot;Proceedings of TYPES’04&quot;, Lecture Notes in Computer Science
, 2005
"... Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to abandon the pe ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
such as the Generic Model and the Random Oracle Model. Using the proof assistant Coq, we provide a machinechecked account of the Generic Model and the Random Oracle Model. We exploit this framework to prove the security of the ElGamal cryptosystem against adaptive chosen ciphertexts attacks. 1
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1646 (70 self)
 Add to MetaCart
We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R
A machinechecked formalization of the generic model and the random oracle model
 in Proceedings of IJCAR’04, vol. 3097, Lecture Notes in Computer Science
"... Abstract. Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to rely on a weaker hypo ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
of breaking a cryptographic scheme. Using the proof assistant Coq, we provide a machinechecked account of the Generic Model and the Random Oracle Model. 1
S.: A machinechecked formalization of Sigmaprotocols
 In: 23rd IEEE Computer Security Foundations symposium, CSF
, 2010
"... Abstract—Zeroknowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by the rules of a protocol, without forcing them to reveal their secrets. Σprotocols are a class of zeroknowledge pro ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
knowledge proofs that can be implemented efficiently and that suffice for a great variety of practical applications. This paper presents a first machinechecked formalization of a comprehensive theory of Σprotocols. The development includes basic definitions, relations between different security properties
A machinechecked framework for relational separation logic
, 2011
"... Abstract. Relational methods are gaining growing acceptance for specifying and verifying properties defined in terms of the execution of two programs—notions such as simulation, observational equivalence, noninterference, and continuity can be elegantly casted in this setting. In previous work, we ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
have proposed program product construction as a technique to reduce relational verification to standard verification. This method hinges on the ability to interpret relational assertions as traditional predicates, which becomes problematic when considering assertions from relational separation logic
A machinechecked proof for a translation of eventb machines to jml specifications
, 2012
"... Abstract. We present a machinechecked soundness proof of a translation of EventB to the Java Modeling Language (JML). The translation is based on an operator EB2Jml that maps EventB events to JML method specifications, and deterministic and nondeterministic assignments to JML method postcond ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We present a machinechecked soundness proof of a translation of EventB to the Java Modeling Language (JML). The translation is based on an operator EB2Jml that maps EventB events to JML method specifications, and deterministic and nondeterministic assignments to JML method post
A statistical test suite for random and pseudorandom number generators for cryptographic applications
, 2001
"... (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use of ..."
Abstract

Cited by 195 (0 self)
 Add to MetaCart
(NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use
Formal certification of codebased cryptographic proofs
 4 th Workshop on Formal and Computational Cryptography (FCC
, 2008
"... As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Gamebased techniques provide a popular approach in which proofs are structured as sequences of games, and in which proof steps es ..."
Abstract

Cited by 84 (25 self)
 Add to MetaCart
precisely and to carry out proofs systematically, typical proofs are so long and involved that formal verification is necessary to achieve a high degree of confidence. We present CertiCrypt, a framework that enables the machinechecked construction and verification of codebased proofs. CertiCrypt is built
Computeraided cryptographic proofs
"... Provable security [6] is at the heart of modern cryptography. It advocates a mathematical approachin which the securityofnew cryptographicconstructions is defined rigorously, and provably reduced to one or several assumptions, such as the hardness of a computational problem, or the existence of an i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of breaking the assumption H in time t ′ (defined as a function of t). EasyCrypt [1] is a framework for building and verifying machinechecked security proofs for cryptographic constructions in the computational model. Following the codebased approach [4], EasyCrypt uses probabilistic programs
Results 1  10
of
351