# US 2024/0205010 A1 · Membership proof device and method for ensuring privacy

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0205010 A1
- Document ID: US20240205010A1
- Status: Published application
- Kind: A1
- Application number: 18/533,973
- Filed: 2023-12-08
- Published: 2024-06-20
- Earliest claimed: 2022-12-19
- Assignees: Iucf-Hyu (Industry-University Cooperation Foundation Hanyang University); Kookmin University Industryacademy Cooperation Foundation
- Applicants: Iucf-Hyu (Industry-University Cooperation Foundation Hanyang University); Kookmin University Industryacademy Cooperation Foundation
- Inventors: Hyun Ok OH; Se Min HAN; Ji Hye KIM
- Web page: https://patentgrep.com/patent/US20240205010A1

## CPC

- H04L 9/3218: {using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs}
- H04L 9/3033: {details relating to pseudo-prime or prime number generation, e.g. primality test}
- H04L 9/3221: {interactive zero-knowledge proofs}
- H04L 9/3249: {using RSA or related signature schemes, e.g. Rabin scheme}
- H04L 9/3271: {using challenge-response}
- H04L 9/302: {involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Disclosed are a membership proof device and method for ensuring privacy. The disclosed membership proof method includes for ensuring privacy includes performing a first calculation for a user's membership proof using a zero-knowledge proof algorithm and performing a second calculation for the user's membership proof on a user value of the user using a Rivest-Shamir-Adleman (RSA) accumulator-based membership proof algorithm and transmitting results of the first and second calculations to a verifier.

## Claims

### Claim 1

A membership proof method for ensuring privacy, comprising:
performing a first calculation for a user's membership proof using a zero-knowledge proof algorithm and performing a second calculation for the user's membership proof on a user value of the user using a Rivest-Shamir-Adleman (RSA) accumulator-based membership proof algorithm; and
transmitting results of the first and second calculations to a verifier.

### Claim 2 (depends on 1)

The membership proof method of claim 1, wherein the first calculation includes addition or multiplication, and
the second calculation includes a calculation for generating a membership proof value through an exponentiation operation on the user value.

### Claim 3 (depends on 2)

The membership proof method of claim 2, wherein the performing of the first calculation comprises generating a conversion value of the user value using a challenge value of the verifier and a random value.

### Claim 4 (depends on 3)

The membership proof method of claim 3, wherein the performing of the first calculation comprises generating commitment values for the user value and the random value, and
the verifier verifies that the user value is a value used in common for the conversion value and the membership proof value using the conversion value and the commitment values.

### Claim 5 (depends on 4)

The membership proof method of claim 4, wherein the performing of the second calculation comprises exponentiating the membership proof value by at least one prime number selected from a preset random prime number set, and
the performing of the first calculation comprises generating the conversion value using a prime number of the random prime number set other than the selected prime number.

### Claim 6 (depends on 5)

The membership proof method of claim 5, wherein the performing of the first calculation comprises generating a commitment value for the other prime number.

### Claim 7

A membership proof method for ensuring privacy, comprising:
generating a Rivest-Shamir-Adleman (RSA) accumulator-based membership proof value through an exponentiation operation on a user value of a user;
generating a conversion value of the user value using a challenge value of a verifier and a random value; and
transmitting the membership proof value and the conversion value to the verifier.

### Claim 8 (depends on 7)

The membership proof method of claim 7, further comprising generating commitment values for the user value and the random value and transmitting the commitment values to the verifier,
wherein the verifier verifies that the user value is a value used in common for the conversion value and the membership proof value using the conversion value and the commitment values.

### Claim 9 (depends on 8)

The membership proof method of claim 8, wherein the generating of the membership proof value comprises exponentiating the membership proof value by at least one prime number selected from a preset random prime number set, and
the generating of the conversion value comprises generating the conversion value using a prime number of the random prime number set other than the selected prime number.

### Claim 10 (depends on 9)

The membership proof method of claim 9, wherein the generating of the commitment values comprises generating a commitment value for the other prime number.

### Claim 11

A membership proof device for ensuring privacy, comprising:
a memory;
at least one processor electrically connected to the memory; and
a communicator,
wherein the processor performs a first calculation for a user's membership proof using a zero-knowledge proof algorithm and performs a second calculation for the user's membership proof on a user value of the user using a Rivest-Shamir-Adleman (RSA) accumulator-based membership proof algorithm, and
the communicator transmits results of the first and second calculations to a verifier.

### Claim 12 (depends on 11)

The membership proof device of claim 11, wherein the zero-knowledge proof algorithm is a zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARK) algorithm.