370 search results - page 15 / 74 » Limits of Constructive Security Proofs |
169
click to vote
VMCAI
2004
Springer
15 years 10 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
128
click to vote
WISTP
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
133
click to vote
IMA
1997
Springer
15 years 9 months ago
1997
Springer
This paper reviews constructions of hash functions and MAC algorithms based on block ciphers. It discusses the main requirements for these cryptographic primitives, motivates these...
166
Voted
AIMSA
1998
Springer
15 years 9 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
176
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...