Using an efficient hash chain and delaying function to improve an e-lottery scheme

DOI10.1080/00207160701294426MaRDI QIDQ5758192zbMATH OpenOpenAlexFDO

Authors Yining Liu, Lei Hu, Heguo Liu

Publication date 3 September 2007

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160701294426

zbMATH Keywords

delaying functione-lotterymulti-level hash chain

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1689604
• Euro-Par 2004 Parallel Processing
• An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
• A fast and efficient chaos-based keyed hash function
• Efficient verifiable multi-secret sharing scheme based on hash function
• Hashing with Elliptic Curve L-Functions
• An ordered minimal perfect hashing scheme based upon Euler's theorem
• An efficient multi-use multi-secret sharing scheme based on hash function
• Efficient indifferentiable hashing into ordinary elliptic curves

Cited in

(2)

• An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
• scientific article; zbMATH DE number 2080691 (Why is no real title available?)

This page was built for publication: Using an efficient hash chain and delaying function to improve an e-lottery scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758192)