Sciweavers

72 search results - page 12 / 15
» On Partial Encryption of RDF-Graphs
Sort
View
CCS
2006
ACM
14 years 1 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...
ASIACRYPT
2009
Springer
14 years 4 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
CCS
2005
ACM
14 years 3 months ago
Tracking anonymous peer-to-peer VoIP calls on the internet
Peer-to-peer VoIP calls are becoming increasingly popular due to their advantages in cost and convenience. When these calls are encrypted from end to end and anonymized by low lat...
Xinyuan Wang, Shiping Chen, Sushil Jajodia
CCS
2007
ACM
14 years 4 months ago
Uclinux: a linux security module for trusted-computing-based usage controls enforcement
Usage controls allow the distributor of some information to limit how recipients of that information may use it. The Trusted Computing Group has standardized Trusted Platform Modu...
David Kyle, José Carlos Brustoloni
SBCCI
2006
ACM
124views VLSI» more  SBCCI 2006»
14 years 3 months ago
A cryptography core tolerant to DFA fault attacks
This work describes a hardware approach for the concurrent fault detection and error correction in a cryptographic core. It has been shown in the literature that transient faults ...
Carlos Roberto Moratelli, Érika F. Cota, Ma...