Sciweavers

1059 search results - page 181 / 212
» Modeling Security Protocols as Games
Sort
View
IACR
2011
196views more  IACR 2011»
12 years 7 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
FC
2004
Springer
89views Cryptology» more  FC 2004»
14 years 1 months ago
Electronic National Lotteries
We describe the design and implementation of secure and robust protocol and system for a national electronic lottery. Electronic lotteries at a national level are a viable cost eï¬...
Elisavet Konstantinou, Vasiliki Liagkou, Paul G. S...
AGENTS
2000
Springer
13 years 12 months ago
Adaptivity in agent-based routing for data networks
Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems MAS's in noisy environme...
David Wolpert, Sergey Kirshner, Christopher J. Mer...
CN
2004
122views more  CN 2004»
13 years 7 months ago
Group rekeying with limited unicast recovery
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee
WETICE
1998
IEEE
13 years 12 months ago
The Problem with Multiple Roots in Web Browsers - Certificate Masquerading
Much work is going into securing the public key infrastructure (PKI). Various models for trust exist; Pretty Good Privacy (PGP) and the Progressive-Constraint Trust model are exam...
James M. Hayes