2661 search results - page 397 / 533 » Quantum Complexity Classes |
136
Voted
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 9 months ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
101
Voted
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
168
click to vote
TGC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
139
Voted
WCC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
121
Voted
ECLIPSE
2004
ACM
15 years 9 months ago
2004
ACM
Programming courses of all levels rely heavily on code examples. Often, to cover non-trivial subjects, it is convenient to present examples in the form of a tutorial. Such tutoria...