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

Journal of Mathematical Sciences

Indistinguishability of particles or independence of the random variables?

Istvan Vincze

Published Apr 1, 1997• 2 citations
Publisher
DOI
10.1007/bf02398432

Related papers

Indistinguishability of particles and exchangeable random variables

Istvan Vincze

De Gruyter eBooks•Dec 31, 1985•0 citations

Indistinguishable particles and hidden variables

Adonai S. Sant’Anna, Décio Krause

arXiv:quant-ph/9607015•Foundations of Physics Letters•Oct 1, 1997•9 citations

Computational Independence in the Design of Cryptographic Protocols

István Vajda

Statistical independence of instances of primitives and protocols is a clear-cut approach for guaranteeing protection against harmful interactions in concurrent and multi-execution environment.Therefore it is surprising that computational indistinguishability of independence from dependence between two or several random variables received no attention since the introduction of classic binary pseudorandom sequences.In this work we propose the use of the notion of computational independence (CI) in the analysis and design of provably secure cryptographic protocols.We generalize the classic result on equivalence of unpredictability and CI to general non-binary random variables.An application of this result is the use of unpredictability-based standard secure primitives in supporting the achievement of CI.This work is inherently related to Canetti's universal composition framework [4], [5].

International Journal of Computer Network and Information Security•Oct 8, 2016•2 citations

Statistical Equivalence and Particle Indistinguishability

Bernard H. Lavenda

Physics Essays•Jun 1, 1992•0 citations

Entanglement Duality Assisted Secure Key Distribution

Ayan Biswas, Nijil Lal, Anindya Banerji +1 more

Duality of entanglement, a property of quantum indistinguishable particles, manifests that entanglement in only one variable can be revealed at a time. The concept is used to demonstrate a device independent quantum key distribution protocol.

Frontiers in Optics•Jan 1, 2020•0 citations

The Independence of Complex Probabilities

Harvard University Press eBooks•Jun 30, 2009•0 citations
Statistical independence of instances of primitives and protocols is a clear-cut approach for guaranteeing protection against harmful interactions in concurrent and multi-execution environment.Therefore it is surprising that computational indistinguishability of independence from dependence between two or several random variables received no attention since the introduction of classic binary pseudorandom sequences.In this work we propose the use of the notion of computational independence (CI) in the analysis and design of provably secure cryptographic protocols.We generalize the classic result on equivalence of unpredictability and CI to general non-binary random variables.An application of this result is the use of unpredictability-based standard secure primitives in supporting the achievement of CI.This work is inherently related to Canetti's universal composition framework [4], [5].