Results 1  10
of
1,261
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
Programming Language Techniques for Cryptographic Proofs
"... CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the codebased paradigm, in which the statement of security, and the hypotheses under which it is proved, are expressed using probabilistic programs. It provides a set ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the codebased paradigm, in which the statement of security, and the hypotheses under which it is proved, are expressed using probabilistic programs. It provides a
Short Noninteractive Cryptographic Proofs
, 2000
"... We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. We assume the theorem is represented by a boolean circuit, of size m gates, which is satisfiable if and only if the theorem ho ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. We assume the theorem is represented by a boolean circuit, of size m gates, which is satisfiable if and only if the theorem
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
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
A Probabilistic Hoarestyle Logic for Cryptographic Proofs
, 2005
"... We extend a Probabilistic Hoarestyle logic to formalize reduction based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. ..."
Abstract
 Add to MetaCart
We extend a Probabilistic Hoarestyle logic to formalize reduction based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced.
A plausible approach to computeraided cryptographic proofs.
, 2005
"... This paper tries to sell a potential approach to making the process of writing and verifying our cryptographic proofs less prone to errors. Specifically, I advocate creating an automated tool to help us with the mundane parts of writing and checking common arguments in our proofs. On a high level, t ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
This paper tries to sell a potential approach to making the process of writing and verifying our cryptographic proofs less prone to errors. Specifically, I advocate creating an automated tool to help us with the mundane parts of writing and checking common arguments in our proofs. On a high level
Formal CertificationofCodeBasedCryptographicProofs
"... 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
 Add to MetaCart
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
XML Implementation of Short NonInteractive Cryptographic Proofs
"... The goal of this project was to design and implement an additional XML feature to the Professor Fischer’s Vickrey Auction certification program. Vickrey implements a noninteractive cryptographic certification program using the short noninteractive proofs as detailed by Boyar, Damgard, and Peralta. ..."
Abstract
 Add to MetaCart
The goal of this project was to design and implement an additional XML feature to the Professor Fischer’s Vickrey Auction certification program. Vickrey implements a noninteractive cryptographic certification program using the short noninteractive proofs as detailed by Boyar, Damgard, and Peralta
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS ∗
"... With today’s dissemination of embedded systems manipulating sensitive data, it has become important to equip lowlevel programs with strong security guarantees. Unfortunately, security proofs as done by cryptographers are about algorithms, not about concrete implementations running on hardware. In t ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
With today’s dissemination of embedded systems manipulating sensitive data, it has become important to equip lowlevel programs with strong security guarantees. Unfortunately, security proofs as done by cryptographers are about algorithms, not about concrete implementations running on hardware
Results 1  10
of
1,261