Sciweavers

340 search results - page 11 / 68
» ets 2009
Sort
View
FC
2009
Springer
93views Cryptology» more  FC 2009»
15 years 6 months ago
Detecting Denial of Service Attacks in Tor
Abstract. Tor is currently one of the more popular systems for anonymizing near real-time communications on the Internet. Recently, Borisov et al. proposed a denial of service base...
Norman Danner, Danny Krizanc, Marc Liberatore
96
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 10 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
EMNLP
2010
14 years 9 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
ASIACRYPT
2010
Springer
14 years 9 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
PKC
2009
Springer
180views Cryptology» more  PKC 2009»
16 years 9 days ago
Security of Sanitizable Signatures Revisited
Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer. That is, the s...
Anja Lehmann, Christina Brzuska, Dominique Schr&ou...