35 search results - page 6 / 7 » Partial Order Reduction for Branching Security Protocols |
IEEECIT
2010
IEEE
14 years 9 months ago
2010
IEEE
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...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
114
click to vote
ANSS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper describes a secure and reliable method for storing data in a distributed hash table (DHT) leveraging the inherent properties of the DHT to provide a secure storage subs...
100
click to vote
FORMATS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
ASIACRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...