Batch Processing for Proofs of Partial Knowledge and Its Applications

Chida, Koji; Yamamoto, Go

doi:10.1093/ietfec/e91-a.1.150

Search citation statements

Order By: Relevance

Paper Sections

Select...

Security Model and Background1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

2013

Publication Types

Select...

Book5

Article1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 11 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [12, 13], batch ZK proof is employed to improve efficiency of bid validity check. Another batch proof technique is proposed in [41], which can be applied to bid validity check. However, their improvement in efficiency is not great enough to ease the efficiency concern in bid validity check.…”

Section: Security Model and Backgroundmentioning

confidence: 99%

Efficient proof of bid validity with untrusted verifier in homomorphic e‐auction

Peng

2013

IET Information Security

View full text Add to dashboard Cite

Section: Security Model and Backgroundmentioning

confidence: 99%

Efficient proof of bid validity with untrusted verifier in homomorphic e‐auction

Peng

2013

IET Information Security

View full text Add to dashboard Cite

“…Another batch proof technique is proposed in [8], which can be applied to bid validity check. However, their improvement in efficiency is not great enough to ease the efficiency concern in bid validity check.…”

Section: Introductionmentioning

confidence: 99%

Multiplicative Homomorphic E-Auction with Formally Provable Security

Peng

Henricksen

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A new method, homomorphic e-auction based on multiplicative homomorphic encryption algorithm like ElGamal encryption is proposed in this paper. Its advantage is obvious and useful in practice: efficient distributed private key generation and thus efficient trust sharing. A long existing problem in homomorphic e-auction, inefficiency of bid validity check, is solved in the new multiplicative homomorphic eauction scheme in this paper, which employs efficient bid re-formatting to enforce bid validity. Another contribution of the new multiplicative homomorphic e-auction scheme is that it is the first e-auction scheme to provide formal and comprehensive security analysis to achieve formally provable security (especially privacy).

show abstract

Efficient Vote Validity Check in Homomorphic Electronic Voting

Peng

Bao

2009

Information Security and Cryptology – ICISC 2008

View full text Add to dashboard Cite

Batch Processing for Proofs of Partial Knowledge and Its Applications

Cited by 11 publications

References 17 publications

Efficient proof of bid validity with untrusted verifier in homomorphic e‐auction

Efficient proof of bid validity with untrusted verifier in homomorphic e‐auction

Multiplicative Homomorphic E-Auction with Formally Provable Security

Efficient Vote Validity Check in Homomorphic Electronic Voting

Contact Info

Product

Resources

About