Sciweavers

5476 search results - page 111 / 1096
» Resettably Secure Computation
Sort
View
IJNSEC
2010
128views more  IJNSEC 2010»
14 years 11 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
ACSC
2002
IEEE
15 years 9 months ago
Bracket Capabilities for Distributed Systems Security
The per-method access control lists of standard middleware technologies allow only simple forms of access control to be expressed and enforced. Research systems based on capabilit...
Mark Evered
AINA
2006
IEEE
15 years 10 months ago
Property-Based Taming of Lying Mobile Nodes
Intelligent security protocols can verify whether the involved principals have properties that are defined based on certain functional and security policies. The property we focu...
Mark Manulis, Ahmad-Reza Sadeghi
CCS
2010
ACM
15 years 3 months ago
NoTamper: automatic blackbox detection of parameter tampering opportunities in web applications
Web applications rely heavily on client-side computation to examine and validate form inputs that are supplied by a user (e.g., “credit card expiration date must be valid”). T...
Prithvi Bisht, Timothy Hinrichs, Nazari Skrupsky, ...
ET
2010
89views more  ET 2010»
15 years 2 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard