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...
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when...
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...
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...
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...