Constructing Abelian Varieties for Pairing-Based Cryptography

Abstract Card-based cryptography provides simple and practicable protocols for performing secure multi-party computation with just a deck of cards. For the sake simplicity, this is often done using cards only two symbols, e.g., $$\clubsuit $$ ♣ $$\heartsuit ♡ . Within paper, we also target se...

certificateless public key cryptography (cl-pkc) is a useful method in order to solve the problems of traditional public key infrastructure (i. e. large amount of computation, storage and communication cost for managing certificates) and id-based public key cryptography (i. e. key escrow problem), simultaneously. a signcryption scheme is an important primitive in cryptographic protocols which p...

We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The scheme we offer is in the sense that it combines information-theoretic security with public-key cryptography. In addition, general and can be applied any network, cryptosystem. Our based on information theoretic notion of individual secrecy, which t...

Abstract It is known that secure computation can be done by using a deck of physical cards. This area called card-based cryptography. Shinagawa et al. (in: Provable security—9th international conference, ProvSec 2015, Kanazawa, Japan, 2015) proposed regular n -sided polygon cards enable to compute functions over $${\mathbb {Z}}/n{\mathbb {Z}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/M...