4340 search results - page 197 / 868 » Formal Methods and Cryptography |
140
click to vote
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
163
click to vote
COCO
1993
Springer
15 years 8 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
124
click to vote
INFORMATICALT
2000
15 years 4 months ago
2000
Recently, Harn proposed an efficient scheme that can batch verification multiple RSA digital signatures. His scheme can reduce signature verification time. However, there is a weak...
142
click to vote
IMCSIT
2010
15 years 2 months ago
2010
The paper presents selected security aspects related to confidentiality, privacy, trust and authenticity issues of a distributed, agent-based computing. Particular attention has be...
145
click to vote
WS
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...