Abstract: The technical concept of the present invention relates to an RSA accumulator-based lookup argument method for performing lookup argument on a composite number and duplicated element. According to an embodiment of the present disclosure, RSA accumulator-based lookup argument method performed by at least one processor may include obtaining a table vector including a plurality of table values, generating a plurality of prime number random values, generating a plurality of prime number table values respectively corresponding to the plurality of table values by using the plurality of prime number random values, generating a prime number table vector by using the plurality of prime number table values and the plurality of prime number random values, publishing the prime number table vector, and performing RSA accumulator-based lookup argument by using the prime number table vector to check whether an index value is included in the table vector.

Abstract: The present invention relates to a reserve contract method for generating single transaction in response to a plurality of contract requests. The reserve contract method, performed by at least one processor, includes receiving a plurality of contract requests for a plurality of reserves; obtaining a mid-large commit value based on the plurality of reserves and a plurality of random values using a verify key; generating a hash value based on the mid-large commit value; generating a large reserve value from the plurality of reserves based on the hash value; generating a large random value based on the plurality of random values based on the hash value; obtaining an proof value using the mid-large commit value, the large reserve value, and the large random value using a zero-knowledge proof algorithm; and transmitting the proof value as a transaction. The mid-large commit value has a Pedersen commitment format.

Abstract: The present invention relates to a method of contracting reserves using a Pedersen commitment and a method of proving reserves using a Pedersen commitment based zero-knowledge proof algorithm. The method of contracting reserves performed by at least one processor includes loading a reserve database in which a plurality of reserves corresponding to a plurality of accounts are stored; generating a plurality of commit values respectively corresponding to the plurality of accounts using a commit key and a plurality of random values; generating a transaction on a smart contract based on the generated plurality of commit values; calculating a total commit value based on the commit key, a total random value corresponding to a sum of the plurality of random values, and a total reserve; and generating a data set including the total commit value, the total reserve, and the commit key.

Abstract: The present invention is an encryption method based on identification using a Pedersen commitment and a decryption method corresponding to the same. An encryption method of a message based on identification, performed by at least one processor, includes steps of receiving a public parameter and a public key, randomly determining an encryption constant, parsing a plurality of parameters from the public parameter, calculating a first cypher text and a second cypher text by using the plurality of parameters, the encryption constant, and the message, parsing an ID value including a plurality of bits from the public key, calculating a third cypher text by using the ID value, and outputting the first cypher text, the second cypher text, and the third cypher text. At least one of the first cypher text, the second cypher text, and the third cypher text has a Pedersen commitment format.