Sciweavers

325 search results - page 3 / 65
» Proofs of Restricted Shuffles
Sort
View
WINE
2010
Springer
109views Economy» more  WINE 2010»
13 years 7 months ago
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences
In this paper, we characterize strategy-proof voting rules when the set of alternatives has a multi-issue structure, and the voters' preferences are represented by acyclic CP-...
Lirong Xia, Vincent Conitzer
MKM
2007
Springer
14 years 3 months ago
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure...
Andrea Asperti, Enrico Tassi
IANDC
2002
84views more  IANDC 2002»
13 years 9 months ago
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
Y. Abramson, Alexander Moshe Rabinovich
CRYPTO
2012
Springer
254views Cryptology» more  CRYPTO 2012»
12 years 7 days ago
Breaking and Repairing GCM Security Proofs
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu
POPL
2012
ACM
12 years 5 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...