Sciweavers

72 search results - page 12 / 15
» Reply to Rao et al. and Lee et al
Sort
View
CSFW
2006
IEEE
15 years 3 months ago
Coercion-Resistance and Receipt-Freeness in Electronic Voting
In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an e...
Stéphanie Delaune, Steve Kremer, Mark Ryan
ACNS
2005
Springer
97views Cryptology» more  ACNS 2005»
15 years 3 months ago
Thompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
Vladimir Shpilrain, Alexander Ushakov
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 1 days ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
15 years 10 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
83
Voted
FOCS
2008
IEEE
15 years 4 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...