An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
From MaRDI portal
Publication:2334963
DOI10.3390/sym11010088zbMath1423.94135OpenAlexW2910771475WikidataQ128577502 ScholiaQ128577502MaRDI QIDQ2334963
Yining Liu, Zhe Xia, Chin-Chen Chang, Ching-Fang Hsu
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym11010088
Symmetric functions and generalizations (05E05) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- Minimal determinantal representations of bivariate polynomials
- Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
- How to share a secret
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- On Unconditionally Secure Robust Distributed Key Distribution Centers
- The round complexity of verifiable secret sharing and secure multicast
- Using an efficient hash chain and delaying function to improve an e-lottery scheme
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials