Sciweavers

233 search results - page 31 / 47
» CAPTCHA: Using Hard AI Problems for Security
Sort
View
IPSN
2010
Springer
15 years 4 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
EUROCRYPT
2011
Springer
14 years 1 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
115
Voted
PKC
2011
Springer
169views Cryptology» more  PKC 2011»
14 years 14 days ago
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
Jean-Sébastien Coron, Antoine Joux, Avradip...
CCS
2006
ACM
15 years 1 months ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee
CCS
2008
ACM
14 years 11 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung