Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
118
Optimistic Mixing for Exit-Polls
- Asiacrypt 2002, LNCS 2501
, 2002
"... We propose a new mix network that is optimized to produce a correct output very fast when all mix servers execute the mixing protocol correctly (the usual case). Our mix network only produces an output if no server cheats. However, in the rare case when one or several mix servers cheat, we convert t ..."
Abstract
-
Cited by 41 (3 self)
- Add to MetaCart
We propose a new mix network that is optimized to produce a correct output very fast when all mix servers execute the mixing protocol correctly (the usual case). Our mix network only produces an output if no server cheats. However, in the rare case when one or several mix servers cheat, we convert
Four Practical Attacks for “Optimistic Mixing for Exit-Polls”
, 2003
"... Golle, Zhong, Boneh, Jakobsson, and Juels [10] recently presented a very efficient mix-net, that they claim to be both robust, and secure. We present four practical attacks for their mix-net, and break both its privacy and robustness. Each attack exploits and illustrates a separate weakness of the p ..."
Abstract
- Add to MetaCart
Golle, Zhong, Boneh, Jakobsson, and Juels [10] recently presented a very efficient mix-net, that they claim to be both robust, and secure. We present four practical attacks for their mix-net, and break both its privacy and robustness. Each attack exploits and illustrates a separate weakness
Four Practical Attacks for "Optimistic Mixing for Exit-Polls"
, 2003
"... Golle, Zhong, Boneh, Jakobsson, and Juels [10] recently presented a very efficient mix-net, that they claim to be both robust, and secure. We present four practical attacks for their mix-net, and break both its privacy and robustness. Each attack exploits and illustrates a separate weakness of the p ..."
Abstract
-
Cited by 29 (4 self)
- Add to MetaCart
Golle, Zhong, Boneh, Jakobsson, and Juels [10] recently presented a very efficient mix-net, that they claim to be both robust, and secure. We present four practical attacks for their mix-net, and break both its privacy and robustness. Each attack exploits and illustrates a separate weakness
How to Break, Fix, and Optimize “Optimistic Mix For Exit-Polls”
, 2002
"... First we present two attacks for the mix-net proposed by Golle et al. [11], and also propose modifications that counter our attacks. The first attack breaks the privacy of the protocol completely. Our attacks are adaptations of the “relation attack”, discussed by Jakobsson [14], Pfitzmann [29, 28], ..."
Abstract
- Add to MetaCart
First we present two attacks for the mix-net proposed by Golle et al. [11], and also propose modifications that counter our attacks. The first attack breaks the privacy of the protocol completely. Our attacks are adaptations of the “relation attack”, discussed by Jakobsson [14], Pfitzmann [29, 28
PAPER Special Section on Cryptography and Information Security Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions
, 2006
"... weaknesses of two Mix-nets claimed to be robust in the literature. Since such flaws are due to their weak security definitions, we then present a stronger security definition by regarding a Mix-net as a batch decryption algorithm of a CCA secure public-key encryption scheme. We show two concrete att ..."
Abstract
- Add to MetaCart
weaknesses of two Mix-nets claimed to be robust in the literature. Since such flaws are due to their weak security definitions, we then present a stronger security definition by regarding a Mix-net as a batch decryption algorithm of a CCA secure public-key encryption scheme. We show two concrete
Optimistic rule
, 2014
"... a b s t r a c t Multiple criteria sorting methods assign alternatives to predefined ordered categories taking multiple criteria into consideration. The ELECTRE TRI method compares alternatives to several profiles separating the categories. Based on such comparisons, each alternative is assigned to t ..."
Abstract
- Add to MetaCart
threshold in a version of the optimistic ELECTRE TRI rule, which raises additional difficulties w.r.t. the pessimistic rule. We also describe an algorithm that computes robust alternatives ' assignments from assignment examples. These algorithms proceed by solving mixed integer programs. Several
Optimistic Synchronization of Mixed-Mode Simulators
- IN 1998 INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, IPPS'98 (MARCH 30 -- APRIL 3
, 1998
"... Mixed-Mode simulation has been generating considerable interest in the simulation community and has continued to grow as an active research area. Traditional mixed-mode simulation involves the merging of digital and analog simulators in various ways. However, efficient methods for the synchronizatio ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
Mixed-Mode simulation has been generating considerable interest in the simulation community and has continued to grow as an active research area. Traditional mixed-mode simulation involves the merging of digital and analog simulators in various ways. However, efficient methods
Combining Periodic and Probabilistic Checkpointing in Optimistic Simulation
- Proc. 13th Workshop on Parallel and Distributed Simulation (PADS’99
, 1999
"... This paper presents a checkpointing scheme for optimistic simulation which is a mixed approach between periodic and probabilistic checkpointing. The latter, basing on statistical data collected during the simulation, aims at recording as checkpoints states of a logical process that have high probabi ..."
Abstract
-
Cited by 10 (4 self)
- Add to MetaCart
This paper presents a checkpointing scheme for optimistic simulation which is a mixed approach between periodic and probabilistic checkpointing. The latter, basing on statistical data collected during the simulation, aims at recording as checkpoints states of a logical process that have high
Optimistic Concurrency Control for Inverted Files in Text Databases
"... Inverted files are frequently used as index data structures for very large text databases. Most applications of this data structure are for read-only query operations. However, the problem of introducing update operations has deserved little attention so far and yet it has important applications. In ..."
Abstract
- Add to MetaCart
. In this paper we propose an optimistic concurrency control algorithm devised to handle mixes of update operations and read-only queries efficiently. We work on top of the BSP model of parallel computing and take advantage of a BSP Time Warp realization to formulate the proposed algorithm. We present a
Results 1 - 10
of
118
