Sciweavers

162 search results - page 23 / 33
» A Group Signature Scheme from Lattice Assumptions
Sort
View
ACNS
2010
Springer
154views Cryptology» more  ACNS 2010»
15 years 3 months ago
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ2 ) group elements...
Xavier Boyen, Brent Waters
PKC
1998
Springer
107views Cryptology» more  PKC 1998»
15 years 3 months ago
On the Security of ElGamal Based Encryption
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
Yiannis Tsiounis, Moti Yung
CRYPTO
2012
Springer
222views Cryptology» more  CRYPTO 2012»
13 years 1 months ago
Secure Identity-Based Encryption in the Quantum Random Oracle Model
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
Mark Zhandry
CORR
2007
Springer
164views Education» more  CORR 2007»
14 years 10 months ago
Consistency of the group Lasso and multiple kernel learning
We consider the least-square regression problem with regularization by a block 1-norm, that is, a sum of Euclidean norms over spaces of dimensions larger than one. This problem, r...
Francis Bach
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 3 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...