Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Identity-based Non-interactive Common-key Generation

Hideshige Tanaka

Published Aug 24, 2005• 2 citations
Publisher
DOI
10.1109/isit.1991.695180

Related papers

Identity-Based Non-interactive Key Sharing

Hatsukazu Tanaka

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 25, 1994•3 citations

Common causes for quantum identical particles

A. Hovhannisyan, S. Weigert, A. E. Allahverdyan

Violations of Bell's inequalities imply that joint probabilities generated by non-commutative measurements on two (non-identical) quantum particles do not have a single common cause. But joint probabilities generated for such non-identical particles via commutative measurements do have non-trivial common cause variables. We focus on commutative measurements and consider two identical quantum particles, whose density matrices and observables (hermitian operators) are necessarily permutation-symmetric. It is natural to demand that the common cause describing joint probabilities is also permutation symmetric, i.e., it acts symmetrically on both particles. Looking at various ways of defining joint probabilities from the same measurement data, we conclude that either symmetric common causes need not exist (i.e., that the particles can be hiddenly distinguishable), or that symmetric screening variables exist, but they are trivial, i.e., no single common cause can explain all single-measurement correlations.

quant-pharXiv:2606.21768•Europhysics Letters (EPL)•Jun 23, 2026•0 citations

HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES

Yanli Ren, Dawu Gu, Shuozhong Wang +1 more

In a proxy re-encryption scheme, a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in public key settings. Hierarchical identity-based cryptography is a generalization of identity-based encryption that mirrors an organizational hierarchy, which allows a root private key generator to distribute the workload by delegating private key generation and identity authentication to lower-level private key generators. In this paper, we propose a hierarchical identity-based proxy re-encryption (HIBPRE) scheme which achieves IND-PrID-CCA2 security without random oracles. This is the first HIBPRE scheme up to now, and our scheme satisfies unidirectionality, non-interactivity and permits multiple re-encryptions.

International Journal of Foundations of Computer Science•Nov 24, 2010•7 citations

Identity-Based Key Agreement

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•2 citations

Identity based group key agreement in multiple PKG environment

Wang Liming, Wu Chuankun

Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative applications. In this paper, we propose the first identity-based authenticated group key agreement in multiple private key generators (PKG) environment. It is inspired on a new two-party identity-based key agreement protocol first proposed by Hoonjung Lee et al. In our scheme, although each member comes from different domain and belongs to different PKGs which do not share the common system parameters, they can agree on a shared secret group key. We show that our scheme satisfies every security requirements of the group key agreement protocols.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•1 citation

Identity-Based Key Exchange Protocols without Pairings

Dario Fiore, Rosario Gennaro

Transactions on computational science•Jan 1, 2010•11 citations
Violations of Bell's inequalities imply that joint probabilities generated by non-commutative measurements on two (non-identical) quantum particles do not have a single common cause. But joint probabilities generated for such non-identical particles via commutative measurements do have non-trivial common cause variables. We focus on commutative measurements and consider two identical quantum particles, whose density matrices and observables (hermitian operators) are necessarily permutation-symmetric. It is natural to demand that the common cause describing joint probabilities is also permutation symmetric, i.e., it acts symmetrically on both particles. Looking at various ways of defining joint probabilities from the same measurement data, we conclude that either symmetric common causes need not exist (i.e., that the particles can be hiddenly distinguishable), or that symmetric screening variables exist, but they are trivial, i.e., no single common cause can explain all single-measurement correlations.
In a proxy re-encryption scheme, a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in public key settings. Hierarchical identity-based cryptography is a generalization of identity-based encryption that mirrors an organizational hierarchy, which allows a root private key generator to distribute the workload by delegating private key generation and identity authentication to lower-level private key generators. In this paper, we propose a hierarchical identity-based proxy re-encryption (HIBPRE) scheme which achieves IND-PrID-CCA2 security without random oracles. This is the first HIBPRE scheme up to now, and our scheme satisfies unidirectionality, non-interactivity and permits multiple re-encryptions.
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative applications. In this paper, we propose the first identity-based authenticated group key agreement in multiple private key generators (PKG) environment. It is inspired on a new two-party identity-based key agreement protocol first proposed by Hoonjung Lee et al. In our scheme, although each member comes from different domain and belongs to different PKGs which do not share the common system parameters, they can agree on a shared secret group key. We show that our scheme satisfies every security requirements of the group key agreement protocols.