82 search results - page 14 / 17 » Inductive Proofs of Computational Secrecy |
116
click to vote
BIRTHDAY
2003
Springer
15 years 4 months ago
2003
Springer
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
131
click to vote
TLCA
1997
Springer
15 years 4 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
118
click to vote
PLPV
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
104
click to vote
CTRSA
2010
Springer
15 years 3 months ago
2010
Springer
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
105
Voted
AB
2007
Springer
15 years 6 months ago
2007
Springer
Whenever a programmer writes a loop, or a mathematician does a proof by induction, an invariant is involved. The discovery and understanding of invariants often underlies problem s...