Sciweavers

3228 search results - page 383 / 646
» Computationally Sound Proofs
Sort
View
CONCUR
2006
Springer
15 years 7 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous
143
Voted
DAGSTUHL
1996
15 years 5 months ago
On-line Algorithms in Machine Learning
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
Avrim Blum
131
Voted
COMPUTER
2008
86views more  COMPUTER 2008»
15 years 3 months ago
SSL/TLS Session-Aware User Authentication
Man-in-the-middle (MITM) attacks pose a serious threat to SSL/TLS-based e-commerce applications, such as Internet banking. SSL/TLS session-aware user authentication can be used to ...
Rolf Oppliger, Ralf Hauser, David A. Basin
DCC
2000
IEEE
15 years 3 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
124
Voted
CORR
1999
Springer
84views Education» more  CORR 1999»
15 years 3 months ago
Finding an ordinary conic and an ordinary hyperplane
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
Olivier Devillers, Asish Mukhopadhyay