Sciweavers

1094 search results - page 150 / 219
» List signature schemes
Sort
View
STACS
2009
Springer
14 years 2 months ago
Compressed Representations of Permutations, and Applications
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
Jérémy Barbay, Gonzalo Navarro
IEEESP
2008
67views more  IEEESP 2008»
13 years 7 months ago
Cryptographic Test Correction
Abstract. Multiple choice questionnaires (mcqs) are a widely-used assessment procedure where examinees are asked to select one or more choices from a list. This invited talk1 explo...
Éric Levieil, David Naccache
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
The Networked Common Goods Game
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
Jinsong Tan
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
AGTIVE
2003
Springer
14 years 27 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman