Sciweavers

828 search results - page 156 / 166
» Bounded Hairpin Completion
Sort
View
INDOCRYPT
2004
Springer
14 years 27 days ago
Advances in Alternative Non-adjacent Form Representations
Abstract. From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits ...
Gildas Avoine, Jean Monnerat, Thomas Peyrin
JIT
2004
Springer
204views Database» more  JIT 2004»
14 years 27 days ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter
COCOON
2003
Springer
14 years 23 days ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
EUROCRYPT
2003
Springer
14 years 23 days ago
Two-Threshold Broadcast and Detectable Multi-party Computation
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
Matthias Fitzi, Martin Hirt, Thomas Holenstein, J&...
CSFW
2002
IEEE
14 years 15 days ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe