Sciweavers

5255 search results - page 115 / 1051
» Formal Methods for Privacy
Sort
View
111
Voted
MOC
2010
14 years 9 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
107
Voted
MOC
2010
14 years 9 months ago
Choosing the correct elliptic curve in the CM method
We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1-2U points, when p = U2 + dV 2 with 2U, 2V ...
Karl Rubin, Alice Silverberg
ACSAC
1999
IEEE
15 years 6 months ago
Toward a Taxonomy and Costing Method for Security Services
A wide range of security services may be available to applications in a heterogeneous computer network environment. Resource Management Systems (RMSs) responsible for assigning co...
Cynthia E. Irvine, Timothy E. Levin
127
Voted
PROVSEC
2007
Springer
15 years 8 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti
104
Voted
SAC
2010
ACM
15 years 9 months ago
CNL4DSA: a controlled natural language for data sharing agreements
A Data Sharing Agreement (DSA) is an agreement among contracting parties regulating how they share data. A DSA represents a flexible mean to assure privacy of data exchanged on t...
Ilaria Matteucci, Marinella Petrocchi, Marco Luca ...