Sciweavers

222 search results - page 37 / 45
» How to Forget a Secret
Sort
View
TISSEC
2010
72views more  TISSEC 2010»
14 years 8 months ago
Deterring voluntary trace disclosure in re-encryption mix-networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
XiaoFeng Wang, Philippe Golle, Markus Jakobsson, A...
IEEECIT
2010
IEEE
14 years 8 months ago
On Small Subgroup Non-confinement Attack
The small subgroup confinement attack works by confining cryptographic operations within a small subgroup, in which exhaustive search is feasible. This attack is overt and hence ca...
Feng Hao
IFIPTCS
2010
14 years 8 months ago
Safe Equivalences for Security Properties
Abstract. In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference)...
Mário S. Alvim, Miguel E. Andrés, Ca...
CRYPTO
2010
Springer
170views Cryptology» more  CRYPTO 2010»
14 years 6 months ago
Securing Computation against Continuous Leakage
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Shafi Goldwasser, Guy N. Rothblum
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
15 years 4 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...