Elliptic curve implementation of zero-knowledge blobs
โ Scribed by Neal Koblitz
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 349 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0933-2790
No coin nor oath required. For personal study only.
โฆ Synopsis
the authors show how to construct the building blocks for perfect zero-knowledge proofs called "blobs" using the discrete log problem. Contrary to what they remark on p. 73 of [2], we argue that the Mordell group of an elliptic curve is more suitable than the multiplicative group of a finite field for the construction of a hard cryptographic suite of problems.
๐ SIMILAR VOLUMES
In this Note we study indecomposable vector bundles of degree zero over an elliptic curve. We show that each bundle generates a ring and a Tannakian category, such that the ring and the group scheme associated to the Tannakian category are of the same dimension. Furthermore we show that the result d