Sciweavers

171 search results - page 11 / 35
» Braid Group Cryptography
Sort
View
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 9 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
CHES
2007
Springer
115views Cryptology» more  CHES 2007»
14 years 3 months ago
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when...
Marc Joye
EUROCRYPT
2008
Springer
13 years 11 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
ASIACRYPT
2008
Springer
13 years 11 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 9 months ago
Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach t...
Ruchira Naskar, Indranil Sengupta