Multiplicative Homomorphic Time-Lock Puzzles for Fair and Correct Secret Sharing

用于公平和正确秘密共享的乘法同态时间锁定谜题

• 批准号: 2100181
• 金额: --
• 依托单位: Royal Holloway University of London
• 依托单位国家: 英国
• 项目类别: Studentship
• 财政年份: 2018
• 资助国家: 英国
• 起止时间: 2018 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=studentship-2100181
• 关键词: Multiplicative; Homomorphic; Time; Lock; Puzzles

Secret Sharing is a fundamental building block for cryptographic protocols in which parties share a private input among a group in order to reconstruct a secret. Modelling parties as rational players in a game, one concern is how the reconstruction phase of the protocol can ensure a notion of fairness, whereby a player cannot gain an advantage by deviating from their original strategy. Previous works have realised a correct, fair scheme using memory-bounded functions in the reconstruction phase. My scheme will achieve these properties using time-lock puzzles as a form of time-delay encryption. I am currently working on proving correctness and fairness of my scheme. Future work will see me look at the degrees of fairness possible under different modelling assumptions of the secret sharing game

秘密共享是密码协议的基本构建块，其中各方在组之间共享私有输入以重构秘密。将各方建模为博弈中的理性参与者，一个问题是协议的重建阶段如何确保公平性，即参与者不能通过偏离其原始策略来获得优势。以前的作品已经实现了一个正确的，公平的计划，在重建阶段使用内存有界的功能。我的方案将实现这些属性使用时间锁拼图作为一种形式的时间延迟加密。我目前正在努力证明我的计划的正确性和公平性。未来的工作将看到我在不同的秘密共享游戏的建模假设下可能的公平程度