• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.4 no.2
• /
• pp.39-54
• /
• 1994

In cryptography, the notion of zero-knowledge is important. It is also related to complexity theory. In this paper we briefly survey the zero-knowledge proofs in the literature. 1987 Maathematics Subject Classification: 69D56, 69E30, 69F21, Keywords and phrases: interactive proofs, zero-kniwledge, cryptography, complexity theiry.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1992.11a
• /
• pp.25-40
• /
• 1992

In cryptography, the notion of zero-knowledge is important. It is also related to complexity theory. In this paper we briefly survey the zero-knowledge proofs in the literature.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.877-881
• /
• 2002

Digital contents such as image need both secure proving and publicly verification scheme on embedded digital watermark for contents distribution and copyright protection. Specially, we must provide publicly verification mechanism on digital watermark without revealing any of the secret information hidden on digital contents. In this paper, we review on the existing zero knowledge proofs and digital watermarking system, and propose advanced interactive zero knowledge proofs mechanism for enhancing the performance and security of watermark verification process. And it Provides a new watermark verification scheme without revealing any secret on the contents owner's copyright in formation.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.85-94
• /
• 2022

Recently, an LWE-based commitment scheme is proposed. Their construction is statistically hiding as well as computationally binding. On the other hand, the construction of related zero-knowledge protocols is left as an open problem. In this paper, we present zero-knowledge protocols with hardness based on the LWE problem. we show how to instantiate efficient zero-knowledge protocols that can be used to prove linear and sum relations among these commitments. In addition, we show how the variant of LWE, spLWE problem, can be used to instantiate efficient zero-knowledge protocols.

• Smart Media Journal
• /
• v.10 no.3
• /
• pp.48-53
• /
• 2021

The authentication process is a key step that should be used to verify that a user is legitimate, and it should be used to verify that a user is a legitimate user and grant access only to that user. Recently, two-factor authentication and OTP schemes are used by most applications to add a layer of security to the login process and to address the vulnerability of using only one factor for authentication, but this method also allows access to user accounts without permission. This is a known security vulnerability. In this paper, we propose a Zero Knowledge Proofs (ZKP) personal information authentication scheme based on a Smart Contract of a block chain that authenticates users with minimal personal information exposure conditions. This has the advantage of providing many security technologies to the authentication process based on blockchain technology, and that personal information authentication can be performed more safely than the existing authentication method.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1991.11a
• /
• pp.85-94
• /
• 1991

Fiat, Shamir의 ZKIP(zero knowledge interactive proofs) 방식을 이용한 새로운 키분배방식을 제안한다. 본 방식은 평방잉여를 이용한 Fiat, Shamir의 ZKIP 방식을 이용하여 상호인증을 행하고 그 과정에서 교환되는 데이타를 사용하여 비밀통신용 공통키를 생성한다. 공통키 생성 과정에 사용된 데이타가 인증 과정에서 사용된 데이타이고, 인증 과정은 ZKIP 방식을 이용했으므로 제안한 키분배방식 역시 zero knowledge일 것으로 생각되며 ZKIP 방식은 인증 과정의 반복으로 인한 통신량이 많은 반면 제안한 방식은 인증과정에서의 반복횟수가 1이기 때문에 상대적으로 통신량이 적은 이점이 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1285-1303
• /
• 2019

In the current credit scoring system, the credit bureau gathers credit information from financial institutions and calculates a credit score based on it. However, because all sensitive credit information is stored in one central authority, there are possibilities of privacy violations and successful external attacks can breach large amounts of personal information. To handle this problem, we propose privacy-preserving credit scoring in which a user gathers credit information from financial institutions, calculates a credit score and proves that the score is calculated correctly using a zero-knowledge proof and a blockchain. In addition, we propose a zero-knowledge proof scheme that can efficiently prove committed inputs to check whether the inputs of a zero-knowledge proof are actually provided by financial institutions with a blockchain. This scheme provides perfect zero-knowledge unlike Agrawal et al.'s scheme, short CRSs and proofs, and fast proof and verification. We confirmed that the proposed credit scoring can be used in the real world by implementing it and experimenting with a credit score algorithm which is similar to that of the real world.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.245-251
• /
• 2014

Mix network plays a key role in electronic voting to preserve anonymity and lots of mixnet schemes have been proposed so far. However, they requires complex and costly zero-knowledge proofs to provide their correct mixing operations. In 2010, Seb$\acute{e}$ et al. proposed an efficient and lightweight mixnet scheme based on a cryptographic secure hash function instead of zero-knowledge proofs. In this paper, we present a more efficient and faster mixnet scheme than Seb$\acute{e}$ et al.'s scheme under the same assumption. Also, our scheme is secure.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.417-425
• /
• 2012

In 2010, Sebe et al. proposed an efficient and lightweight mixnet scheme for remote voting systems. The scheme based on a cryptographic secure hash function, does not require complex and costly zero-knowledge proofs of their correct mixing operations, thus they claimed that their scheme is simple and efficient. In this paper, we propose more efficient and fast mixnet scheme than Sebe et al.'s scheme under the same assumption.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.3
• /
• pp.403-411
• /
• 2008

In 2005, A. Saxena, B. Soh and S. Priymak [10] proposed a two-flow blind identification protocol. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. In 2008, Y. W. Lee [9] made a method of the active-intruder attack on their identification scheme and proposed a new zero-knowledge blind identification protocol for smart cards. In this paper, we give more simple and fast protocols than above protocols such that the prover using computationally limited devices such as smart cards has no need of computing the bilinear pairings. Computing the bilinear pairings is needed only for the verifier and is secure assuming the hardness of the Discrete-Logarithm Problem (DLP).