Sciweavers

860 search results - page 135 / 172
» Completeness in two-party secure computation: a computationa...
Sort
View
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
13 years 6 days ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
NDSS
2007
IEEE
15 years 4 months ago
Attribute-Based Publishing with Hidden Credentials and Hidden Policies
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...
Apu Kapadia, Patrick P. Tsang, Sean W. Smith
CHI
2009
ACM
15 years 10 months ago
A comprehensive study of frequency, interference, and training of multiple graphical passwords
Graphical password systems have received significant attention as one potential solution to the need for more usable authentication, but nearly all prior work makes the unrealisti...
Katherine Everitt, Tanya Bragin, James Fogarty, Ta...
WCNC
2008
IEEE
15 years 4 months ago
An Enhanced Routing Metric for Fading Wireless Channels
Abstract— In this paper we propose the enhancement of routing metrics through a more complete view of the physical channel. Using cross-layer optimizations, we develop the Distri...
Daniel de Oliveira Cunha, Otto Carlos M. Duarte, G...
ICALP
2007
Springer
15 years 4 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...