An efficient range proof scheme

Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust

Volumn , Issue , 2010, Pages 826-833

  Peng, Kun ^a   Bao, Feng ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78649263246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SocialCom.2010.125     Document Type: Conference Paper

References (21)

1. G Ateniese, J Camenisch, M Joye and G Tsudik. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO '00, pages 255-270.
2. F Boudot and J Traore. Efficient public verifiable secret sharing schemes with fast or delayed recovery. In ICICS '99, pages 87-102.
3. F Boudot. Efficient proofs that a committed number lies in an interval. In EUROCRYPT '00, pages 431-444.
4. J Camenisch, R Chaabouni and A Shelat. Efficient protocols for set membership and range proofs. In ASIACRYPT '08, pages 234-252.
5. J Camenisch and M Michels. A group signature scheme with improved efficiency. In ASIACRYPT '98, pages 160-174.
6. D Chaum, J Evertse and J Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generations. In EUROCRYPT '87, pages 127-141.
7. R Cramer, I Damg̊ard and B Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94, pages 174-187.
8. I Damg̊ard and R Cramer. On Σ-protocols. Cryptologic Protocol Theory, 2002. Available as http://www.daimi.au.dk/~ivan/Sigma.ps.
9. I Damg̊ard and E Fujisaki. A statistically-hiding integer commitment scheme based on groups with hidden order. ASICACRYPT '02, pages 125-142.
10. E Fujisaki and T Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, pages 16-30.
11. M Girault. Self-certified public keys. In EUROCRYPT '91, pages 490-497.
12. S Goldwasser, S Micali, and C Rackoff. The knowledge complexity of interactive proof systems. In SIAM J Computer Vol 18, pages 186-208, 1989.
13. J Groth. Non-interactive zero-knowledge arguments for voting. In ACNS '05, pages 467-482.
14. H. Lipmaa. On diophantine complexity and statistical zero-knowledge arguments. In ASIACRYPT '03, pages 398-415.
15. M Luby. Pseudorandomness and cryptographic applications. Princeton University Press, 1996.
16. K Peng, C Boyd, E Dawson and E Okamoto. A novel range test. In ACISP '06, LNCS4058, pages 247-258.
17. K Peng and E Dawson. Range test secure in the active adversary model. In ACM International Conference Proceeding Series; Vol. 249, AISW2007, pages 159-162.
18. K Peng, F Bao and E Dawson. Correct, private, flexible and efficient range test. In Journal of Researchand Practice in Information Technology Volume 40, Issue 4, 2008, pages 275-291.
19. K Peng and F Bao. Practicalization of a range test and its application to e-auction. In EuroPKI '09, 2009.
20. G Poupard and J Stern. Fair encryption of rsa keys. In EUROCRYPT '00, pages 172-189.
21. C Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4, 1991, pages 161-174, 1991.