Sciweavers

3115 search results - page 576 / 623
» Synthesizing Secure Protocols
Sort
View
SOSP
2007
ACM
16 years 28 days ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
ICPADS
2005
IEEE
15 years 9 months ago
Separable and Anonymous Identity-Based Key Issuing
Abstract. In identity-based (ID-based) cryptosystems, a local registration authority (LRA) is responsible for authentication of users while the key generation center (KGC) is respo...
Ai Fen Sui, Sherman S. M. Chow, Lucas Chi Kwong Hu...
ICIP
2008
IEEE
16 years 5 months ago
Managing privacy data in pervasive camera networks
Privacy protection of visual information is increasingly important as pervasive camera networks becomes more prevalent. The proposed scheme addresses the problem of preserving and...
Sen-Ching S. Cheung, Jithendra K. Paruchuri, Thinh...
SIGSOFT
2008
ACM
16 years 4 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 4 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai