Experimenting With Non-Interactive Range Proofs Based on the Strong RSA Assumption
Range proofs are proofs that a committed number m belongs to a range [a, b] for public constants a, b, without leaking any information about the value m. In this work, we evaluate and analyze the performance of existing techniques for range proofs based on the strong RSA assumption while varying the...
Main Authors: | Myungsun Kim, Hyung Tae Lee |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8805328/ |
Similar Items
-
A Zero-Knowledge Proof System with Algebraic Geometry Techniques
by: Edgar González Fernández, et al.
Published: (2020-01-01) -
Authentication Based on Non-Interactive Zero-Knowledge Proofs for the Internet of Things
by: Francisco Martín-Fernández, et al.
Published: (2016-01-01) -
An investigation into graph isomorphism based zero-knowledge proofs.
by: Ayeh, Eric
Published: (2009) -
Analysis of Non-Interactive Zero Knowledge Proof
by: Hegde, Suprabha Shreepad
Published: (2018) -
A simplified scheme for secure offline electronic payment systems
by: Md. Abdullah Al Rahat Kutubi, et al.
Published: (2021-12-01)