Sciweavers

26 search results - page 4 / 6
» The Discrete Logarithm in Logarithmic -Class Groups and Its ...
Sort
View
CCS
2001
ACM
13 years 11 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
EUROCRYPT
2001
Springer
14 years 23 hour ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
SIAMSC
2011
115views more  SIAMSC 2011»
13 years 2 months ago
A Fast and Stable Solver for Singular Integral Equations on Piecewise Smooth Curves
A scheme is presented for the numerical solution of singular integral equations on piecewise smooth curves. It relies on several techniques: reduction, Nystr¨om discretization, co...
Johan Helsing
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Matrix Hyperbolic Cosine Algorithm and Applications
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
Anastasios Zouzias
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 1 days ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson