793 search results - page 117 / 159 » Argumentation and standards of proof |
102
Voted
CPP
2011
14 years 25 days ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
106
click to vote
IACR
2011
14 years 19 days ago
2011
The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and ...
130
click to vote
ESORICS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
83
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
104
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...