Sciweavers

370 search results - page 15 / 74
» Limits of Constructive Security Proofs
Sort
View
VMCAI
2004
Springer
14 years 1 months ago
Construction of a Semantic Model for a Typed Assembly Language
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...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
WISTP
2009
Springer
14 years 3 months ago
Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card
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...
Hendrik Tews, Bart Jacobs
IMA
1997
Springer
106views Cryptology» more  IMA 1997»
14 years 10 days ago
Hash Functions and MAC Algorithms Based on Block Ciphers
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...
Bart Preneel
AIMSA
1998
Springer
14 years 13 days ago
A Blackboard Architecture for Guiding Interactive Proofs
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
Christoph Benzmüller, Volker Sorge
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 12 months ago
Limitations of Quantum Advice and One-Way Communication
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...
Scott Aaronson