Sciweavers

252 search results - page 33 / 51
» How Secure is Deterministic Encryption
Sort
View
DBSEC
2010
196views Database» more  DBSEC 2010»
13 years 4 months ago
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
Abstract. This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity ...
Amril Syalim, Takashi Nishide, Kouichi Sakurai
ISLPED
2003
ACM
197views Hardware» more  ISLPED 2003»
14 years 27 days ago
Analyzing the energy consumption of security protocols
Security is critical to a wide range of wireless data applications and services. While several security mechanisms and protocols have been developed in the context of the wired In...
Nachiketh R. Potlapally, Srivaths Ravi, Anand Ragh...
GLOBECOM
2007
IEEE
14 years 2 months ago
Inherent Security of Routing Protocols in Ad-Hoc and Sensor Networks
Many of the routing protocols that have been designed for wireless ad-hoc networks focus on energy-efficiency and guaranteeing high throughput in a non-adversarial setting. Howev...
Tanya Roosta, Sameer Pai, Phoebus Chen, Shankar Sa...
POPL
1998
ACM
13 years 12 months ago
Secure Information Flow in a Multi-Threaded Imperative Language
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either hig...
Geoffrey Smith, Dennis M. Volpano
EUROCRYPT
2010
Springer
14 years 13 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman