Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
1-out-of-n Signatures from a Variety of Keys
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
ISC '01 Proceedings of the 4th International Conference on Information Security
Distributed Auction Servers Resolving Winner and Winning Bid without Revealing Privacy of Bids
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops
A range test secure in the active adversary model
ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Batch verification of validity of bids in homomorphic e-auction
Computer Communications
Efficient bid validity check in ElGamal-based sealed-bid e-auction
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A second-price sealed-bid auction with verifiable discriminant of ρo-th root
FC'02 Proceedings of the 6th international conference on Financial cryptography
Practicalization of a range test and its application to e-auction
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
A multiplicative homomorphic sealed-bid auction based on goldwasser-micali encryption
ISC'05 Proceedings of the 8th international conference on Information Security
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
A general, flexible and efficient proof of inclusion and exclusion
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Secure E-auction for mobile users with low-capability devices in wireless network
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
| Hi-index | 0.00 |
A design is proposed in this paper to apply a special membership proof technique and a range test technique to homomorphic e-auction. It answers three open questions. On one hand, the special membership proof technique has some limitations such that so far few appropriate applications have been found for it. Moreover, although only needing a constant cost and achieving very high efficiency the range test technique is so new that no appropriate application has been proposed for it. On the other hand, so far no efficient and secure solution has been found for homomorphic e-auction, especially in bid validity check and range test of sum of bids. In this paper, the special membership proof technique and the range test technique are applied to homomorphic eauction such that all of them benefit from our new design. On one hand, the membership proof technique and the range test technique find an appropriate application and become practical technologies. On the other hand, homomorphic e-auction overcomes its bottlenecks in efficiency and achieves great improvement in performance.