Sciweavers

2137 search results - page 200 / 428
» Proving Abstract Non-interference
Sort
View
176
Voted
TGC
2005
Springer
16 years 14 days ago
Programming Cryptographic Protocols
Cryptographic protocols are useful for trust engineering in distributed transactions. Transactions require specific degrees of confidentiality and agreement between the principal...
Joshua D. Guttman, Jonathan C. Herzog, John D. Ram...
VSTTE
2005
Springer
16 years 14 days ago
WYSINWYX: What You See Is Not What You eXecute
What You See Is Not What You eXecute: computers do not execute source-code programs; they execute machine-code programs that are generated from source code. Not only can the WYSINW...
Gogul Balakrishnan, Thomas W. Reps, David Melski, ...
166
Voted
AISC
2004
Springer
16 years 12 days ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
139
Voted
ASIACRYPT
2004
Springer
16 years 12 days ago
On Provably Secure Time-Stamping Schemes
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
Ahto Buldas, Märt Saarepera
177
Voted
ASIACRYPT
2004
Springer
16 years 12 days ago
How Far Can We Go Beyond Linear Cryptanalysis?
Abstract. Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we define ...
Thomas Baignères, Pascal Junod, Serge Vaude...