Sciweavers

349 search results - page 61 / 70
» Compositional Security for Task-PIOAs
Sort
View
PET
2004
Springer
15 years 3 months ago
Reputable Mix Networks
We define a new type of mix network that offers a reduced form of robustness: the mixnet can prove that every message it outputs corresponds to an input submitted by a player wit...
Philippe Golle
CCS
2009
ACM
15 years 1 months ago
On voting machine design for verification and testability
We present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing. The system was desig...
Cynthia Sturton, Susmit Jha, Sanjit A. Seshia, Dav...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
JSS
2008
136views more  JSS 2008»
14 years 9 months ago
Specification, decomposition and agent synthesis for situation-aware service-based systems
Service-based systems are distributed computing systems with the major advantage of enabling rapid composition of distributed applications, such as collaborative research and deve...
Stephen S. Yau, Haishan Gong, Dazhi Huang, Wei Gao...
ACISP
2003
Springer
15 years 1 months ago
Digital Signature Schemes with Restriction on Signing Capability
In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain numb...
Jung Yeon Hwang, Hyun-Jeong Kim, Dong Hoon Lee, Jo...