Sciweavers

677 search results - page 88 / 136
» Secure Pseudonymous Channels
Sort
View
EUROCRYPT
2008
Springer
15 years 5 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
167
Voted
PERCOM
2005
ACM
16 years 3 months ago
Security Parallels between People and Pervasive Devices
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
Stephen A. Weis
140
Voted
EUROCRYPT
2007
Springer
15 years 9 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
140
Voted
TRUST
2009
Springer
15 years 10 months ago
Secure VPNs for Trusted Computing Environments
Abstract. Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restr...
Steffen Schulz, Ahmad-Reza Sadeghi
136
Voted
WISA
2009
Springer
15 years 10 months ago
You Cannot Hide behind the Mask: Power Analysis on a Provably Secure S-Box Implementation
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
J. Pan, J. I. den Hartog, Jiqiang Lu