Sciweavers

325 search results - page 55 / 65
» Proofs of Restricted Shuffles
Sort
View
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
FM
2006
Springer
153views Formal Methods» more  FM 2006»
14 years 1 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 12 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
CCS
2008
ACM
13 years 11 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
INFOCOM
2009
IEEE
14 years 4 months ago
Searching for Stability in Interdomain Routing
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
Rahul Sami, Michael Schapira, Aviv Zohar