Sciweavers

402 search results - page 12 / 81
» Cryptosystems using Linear Groups
Sort
View
CHI
2006
ACM
15 years 10 months ago
Using perceptual grouping for object group selection
Modern graphical user interfaces support the direct manipulation of objects and efficient selection of objects is an integral part of this user interface paradigm. For the selecti...
Hoda Dehmeshki, Wolfgang Stürzlinger
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
15 years 3 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 22 days ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
DAM
2006
97views more  DAM 2006»
14 years 10 months ago
Entity authentication schemes using braid word reduction
Abstract. Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, ...
Hervé Sibert, Patrick Dehornoy, Marc Giraul...
AFRICACRYPT
2010
Springer
15 years 3 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...