Sciweavers

5665 search results - page 381 / 1133
» Introduction to Computer Security
Sort
View
JMLR
2008
148views more  JMLR 2008»
15 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
ECCC
1998
88views more  ECCC 1998»
15 years 6 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan
CLEIEJ
2010
15 years 4 months ago
Design, Implementation and Use of a Remote Network Lab with Multiple Users Support as an Aid Teaching Computer Networks
This article presents the design, implementation and use of a remote network lab with multiple users support as an aid to teaching computer networks. The purpose is to enable mult...
Marco Aravena Vivar, Cristian Rodriguez, Andres Ra...
AFRICACRYPT
2010
Springer
16 years 1 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
CRYPTO
2009
Springer
121views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Collusion-Free Multiparty Computation in the Mediated Model
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
Joël Alwen, Jonathan Katz, Yehuda Lindell, Gi...