1818 search results - page 207 / 364 » Granularity-Adaptive Proof Presentation |
114
Voted
PKC
2010
Springer
15 years 7 months ago
2010
Springer
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
124
Voted
TCC
2010
Springer
15 years 7 months ago
2010
Springer
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among ke...
127
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
153
Voted
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
113
Voted
ITP
2010
15 years 7 months ago
2010
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...