Secret sharing is an important technique to ensure secrecy and availability of sensitive information. It is also an indispensable building block in various cryptographic protocols. In the literature, most of these existing protocols are employing Shamir secret sharing, while Blakley one has attracted very little attention. In this paper, we revisit Blakley secret sharing that is based on hyperplane geometry, and illustrate that some of its potentials are yet to be employed. In particular, it has an appealing property that compared with Shamir secret sharing, it not only handles (t, n) secret sharing with similar computational costs, but also handles (n, n) secret sharing with better efficiency. We further apply this property to design a provably secure and optimal resilient proactive secret sharing scheme. Our proposed protocol is versatile to support proactive cryptosystems based on various assumptions, and it employs only one type of verifiable secret sharing as the building block. By contrast, the existing proactive secret sharing schemes with similar properties all employ two different types of verifiable secret sharing. Finally, we briefly discuss some possible extensions of our proposed protocol as well as how to explore more potentials of Blakley secret sharing. 夏喆,男,武汉理工大学副教授、硕士生导师。2009年获得英国萨里大学博士学位,主要研究方向为密码学协议和信息安全,近年来在包括TIFS, IET Information Security, ACISP等国际会议/期刊发表学术论文30余篇,担任多个国际学术会议程序委员会委员。目前担任中国计算机学会推荐国际期刊JISA的副主编和多个信息安全专刊的编委。