Sciweavers

391 search results - page 72 / 79
» Formal Universes
Sort
View
108
Voted
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 4 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
ACISP
2006
Springer
15 years 4 months ago
Online/Offline Signatures and Multisignatures for AODV and DSR Routing Security
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...
Shidi Xu, Yi Mu, Willy Susilo
ECAL
1995
Springer
15 years 3 months ago
Elements of a Theory of Simulation
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
Steen Rasmussen, Christopher L. Barrett
CCS
2008
ACM
15 years 2 months ago
HMAC is a randomness extractor and applications to TLS
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
Pierre-Alain Fouque, David Pointcheval, Séb...
CCS
2008
ACM
15 years 2 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung