Sciweavers

157 search results - page 22 / 32
» Universally Composable Signcryption
Sort
View

Publication
794views
15 years 4 months ago
A Fast Implementation of The Level Set Method Without Solving Partial Differential Equations
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
Yonggang Shi, William Clem Karl
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 8 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
CCS
2009
ACM
14 years 2 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
IPPS
2009
IEEE
14 years 2 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
SECURWARE
2008
IEEE
14 years 2 months ago
A Dependability Case Approach to the Assessment of IP Networks
—IP networks, composing the Internet, form a central part of the information infrastructure of the modern society. Integrated approaches to the assessment of their dependability ...
Ilkka Norros, Pirkko Kuusela, Pekka Savola