2000 search results - page 283 / 400 » Program Transformation and Proof Transformation |
129
Voted
CRYPTO
2005
Springer
15 years 9 months ago
2005
Springer
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS), providing new de...
110
Voted
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
141
Voted
RTA
2004
Springer
15 years 9 months ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
151
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
137
Voted
CRYPTO
2003
Springer
15 years 9 months ago
2003
Springer
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...