Sciweavers

233 search results - page 18 / 47
» CAPTCHA: Using Hard AI Problems for Security
Sort
View
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
AAAI
2010
14 years 11 months ago
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
Lin Xu, Holger Hoos, Kevin Leyton-Brown
STOC
2003
ACM
116views Algorithms» more  STOC 2003»
15 years 2 months ago
New lattice based cryptographic constructions
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
Oded Regev
CODASPY
2012
13 years 5 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...
DRM
2006
Springer
15 years 1 months ago
Securing sensitive content in a view-only file system
One of the most fundamental problems in computer security is protecting sensitive digital information from unauthorized disclosure. There are a number of challenges, such as spywa...
Kevin Borders, Xin Zhao, Atul Prakash