Sciweavers

1064 search results - page 134 / 213
» Cryptography from Anonymity
Sort
View
USS
2008
14 years 21 days ago
The Case for Networked Remote Voting Precincts
Voting in national elections from the comfort of one's home computer may never be practical or secure, but we argue that remote network voting can be both practical and secur...
Daniel Sandler, Dan S. Wallach
MANSCI
2006
122views more  MANSCI 2006»
13 years 10 months ago
Strategic Manipulation of Internet Opinion Forums: Implications for Consumers and Firms
There is growing evidence that consumers are influenced by Internet-based opinion forums before making a variety of purchase decisions. Firms whose products are being discussed in...
Chrysanthos Dellarocas
TCS
2008
13 years 10 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
EUROPKI
2009
Springer
13 years 8 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
SEMWEB
2009
Springer
14 years 4 months ago
XLWrap - Querying and Integrating Arbitrary Spreadsheets with SPARQL
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
Andreas Langegger, Wolfram Wöß