Sciweavers

2967 search results - page 462 / 594
» Cryptology
Sort
View
CRYPTO
2009
Springer
122views Cryptology» more  CRYPTO 2009»
15 years 12 months ago
Utility Dependence in Correct and Fair Rational Secret Sharing
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
Gilad Asharov, Yehuda Lindell
AFRICACRYPT
2010
Springer
15 years 12 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
ASIACRYPT
2007
Springer
15 years 11 months ago
Faster Addition and Doubling on Elliptic Curves
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
Daniel J. Bernstein, Tanja Lange
ASIACRYPT
2007
Springer
15 years 11 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
ASIACRYPT
2007
Springer
15 years 11 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub