515 search results - page 73 / 103 » Secure Parameters for SWIFFT |
137
click to vote
ACNS
2010
Springer
15 years 8 months ago
2010
Springer
To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ2 ) group elements...
127
click to vote
SIGMOD
1995
ACM
15 years 7 months ago
1995
ACM
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious pro...
121
click to vote
NIPS
2004
15 years 5 months ago
2004
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
118
Voted
CCS
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
136
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we experimentally analyse various dynamic timeout adjustment strategies in server queues as potential counter-measures against degradation of service attacks. Previo...