Sciweavers

56 search results - page 10 / 12
» Realizing Hash-and-Sign Signatures under Standard Assumption...
Sort
View
SP
2010
IEEE
206views Security Privacy» more  SP 2010»
14 years 1 months ago
Revocation Systems with Very Small Private Keys
In this work, we design a method for creating public key broadcast encryption systems. Our main technical innovation is based on a new “two equation” technique for revoking us...
Allison B. Lewko, Amit Sahai, Brent Waters
NIPS
2008
13 years 11 months ago
Supervised Exponential Family Principal Component Analysis via Convex Optimization
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
Yuhong Guo
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
COLT
2008
Springer
13 years 11 months ago
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
Shai Ben-David, Tyler Lu, Dávid Pál