397 search results - page 23 / 80 » Pseudorandom Functions and Lattices |
138
click to vote
JMIV
1998
15 years 28 days ago
1998
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For m...
112
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
155
click to vote
PKC
2012
Springer
13 years 3 months ago
2012
Springer
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
111
click to vote
CPHYSICS
2011
14 years 8 months ago
2011
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...