119 search results - page 20 / 24 » Finite models for formal security proofs |
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
SACRYPT
1998
Springer
13 years 11 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
ACISP
2006
Springer
13 years 11 months ago
2006
Springer
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...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
JOC
2011
12 years 10 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...