Sciweavers

370 search results - page 63 / 74
» Limits of Constructive Security Proofs
Sort
View
AFRICACRYPT
2010
Springer
14 years 1 months ago
Strong Cryptography from Weak Secrets
the full version of the extended abstract which appears in Africacrypt ’10 (3 – 6 may 2010, Stellenbosch, South Africa) D. Bernstein and T. Lange Eds., Springer-Verlag, LNCS 60...
Xavier Boyen, Céline Chevalier, Georg Fuchs...
EUROCRYPT
2008
Springer
13 years 9 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 8 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
SPIC
2010
13 years 2 months ago
Attention-based video streaming
This paper presents a complete framework for attention-based video streaming for low bandwidth networks. First, motivated by the fovea-periphery distinction of biological vision s...
Çagatay Dikici, H. Isil Bozma
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 8 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...