Sciweavers

915 search results - page 80 / 183
» Proof labeling schemes
Sort
View
LREC
2008
62views Education» more  LREC 2008»
13 years 9 months ago
GENIA-GR: a Grammatical Relation Corpus for Parser Evaluation in the Biomedical Domain
t the construction of a corpus for parser evaluation in the biomedical domain. A 50-abstract subset (492 sentences) of the GENIA corpus (Kim et al., 2003) is annotated with labele...
Yuka Tateisi, Yusuke Miyao, Kenji Sagae, Jun-ichi ...
ESOP
2000
Springer
13 years 11 months ago
Sharing Continuations: Proofnets for Languages with Explicit Control
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
Julia L. Lawall, Harry G. Mairson
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 8 months ago
A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information
In this note we give a precise formulation of "resistance to arbitrary side information" and show that several relaxations of differential privacy imply it. The formulat...
Shiva Prasad Kasiviswanathan, Adam Smith
JOC
2010
82views more  JOC 2010»
13 years 2 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 3 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen