US 12,457,109 B2
Membership proof device and method for ensuring privacy
Hyun Ok Oh, Seoul (KR); Se Min Han, Seoul (KR); and Ji Hye Kim, Seoul (KR)
Assigned to IUCF-HYU (INDUSTRY-UNIVERSITY COOPERATION FOUNDATION HANYANG UNIVERSITY), Seoul (KR); and KOOKMIN UNIVERSITY INDUSTRY ACADEMY COOPERATION FOUNDATION, Seoul (KR)
Filed by IUCF-HYU (INDUSTRY-UNIVERSITY COOPERATION FOUNDATION HANYANG UNIVERSITY), Seoul (KR); and KOOKMIN UNIVERSITY INDUSTRYACADEMY COOPERATION FOUNDATION, Seoul (KR)
Filed on Dec. 8, 2023, as Appl. No. 18/533,973.
Claims priority of application No. 10-2022-0178009 (KR), filed on Dec. 19, 2022.
Prior Publication US 2024/0205010 A1, Jun. 20, 2024
Int. Cl. H04L 9/30 (2006.01); H04L 9/32 (2006.01)
CPC H04L 9/3218 (2013.01) [H04L 9/3033 (2013.01); H04L 9/3221 (2013.01); H04L 9/3249 (2013.01); H04L 9/3271 (2013.01); H04L 9/302 (2013.01)] 8 Claims
OG exemplary drawing
 
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,
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,
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,
wherein the performing of the first calculation comprises generating commitment values for the user value and the random value, and
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.