Sciweavers

563 search results - page 99 / 113
» Verifiable Signature Sharing
Sort
View
EUROCRYPT
2011
Springer
13 years 9 days ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
INFOCOM
2011
IEEE
13 years 7 days ago
A robust optimization approach to backup network design with random failures
—This paper presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffi...
Matthew Johnston, Hyang-Won Lee, Eytan Modiano
CSFW
2012
IEEE
11 years 11 months ago
Discovering Concrete Attacks on Website Authorization by Formal Analysis
—Social sign-on and social sharing are becoming an ever more popular feature of web applications. This success is largely due to the APIs and support offered by prominent social ...
Chetan Bansal, Karthikeyan Bhargavan, Sergio Maffe...
ICFP
2008
ACM
14 years 8 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
FSTTCS
2003
Springer
14 years 2 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh