Sciweavers

915 search results - page 32 / 183
» Proof labeling schemes
Sort
View
RTA
2004
Springer
14 years 1 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
ASIACRYPT
2007
Springer
14 years 2 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
ITP
2010
159views Mathematics» more  ITP 2010»
13 years 11 months ago
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 code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...
LICS
2002
IEEE
14 years 24 days ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
IJNSEC
2008
69views more  IJNSEC 2008»
13 years 7 months ago
Proof of Forward Security for Password-based Authenticated Key Exchange
Recently, M. Abdalla et al. proposed a slightly different variant of AuthA, based on the scheme proposed by E. Bresson et al., and provided the first complete proof of forward-sec...
Shuhua Wu, Yuefei Zhu