Sciweavers

400 search results - page 24 / 80
» Cryptography and computer security for undergraduates
Sort
View
CSFW
2007
IEEE
14 years 2 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
IEICET
2008
147views more  IEICET 2008»
13 years 7 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
CEAS
2006
Springer
13 years 11 months ago
Teaching Spam and Spyware at the University of C@1g4ry
The University of Calgary is attacking the problems of spam and spyware from the angle of education. "Spam and Spyware" is a computer science course offered at both the ...
John Aycock
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 8 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...
WETICE
2003
IEEE
14 years 27 days ago
Attack-Resistance of Computational Trust Models
The World Wide Web encourages widely-distributed, open, decentralised systems that span multiple administrative domains. Recent research has turned to trust management [4] as a fr...
Andrew Twigg, Nathan Dimmock