2237 search results - page 25 / 448 » On the Security of Random Sources |
101
click to vote
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
109
click to vote
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
ISI
2008
Springer
14 years 8 months ago
2008
Springer
We discuss how methods from social network analysis could be combined with methodologies from database mediator technology and information fusion in order to give police and other ...
MOBISEC
2009
Springer
15 years 4 months ago
2009
Springer
Explosive growth of the Internet and lack of mechanisms that validate the authenticity of a packet source produced serious security and accounting issues. In this paper, we propose...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...