OpenSquare: Decentralized Repeated Modular Squaring Service
OpenSquare: Decentralized Repeated Modular Squaring Service
复制标题
OpenSquare：去中心化重复模块化平方服务
DOI：
10.1145/3460120.3484809
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Schröder, Dominique
中科院分区：
文献类型：
--
作者：
Thyagarajan, Sri Aravinda;Gong, Tiantian;Bhat, Adithya;Kate, Aniket;Schröder, Dominique
重复模平方是一种通用的计算操作，它导致了诸如时间锁谜题(TLP)和可验证延迟函数(VDF)之类的时间密码原语的实际构造，这些原语具有快速增长的应用列表。虽然区块链领域对定时加密原语有巨大的兴趣，但我们发现需要立即关注其大规模实际采用的两个现实问题：第一，对于大多数用户来说，不断执行计算的要求似乎不现实。其次，由于缺乏启发式方法和经验，为边界(T)选择参数似乎很复杂。我们提出了OpenSquare，这是一个分散的、重复的模块平方服务，它克服了上述问题。OpenSquare允许客户通过智能合同将其重复的模平方计算外包给任何计算能力强大的服务器，这些服务器以不可链接的方式提供奖励计算服务。OpenSquare自然为我们提供了关于预先指定的数字(T)和一段时间内必要的重复平方的相应奖励量的公开可计算的启发式算法。此外，OpenSquare以抵抗Sybil的方式奖励单个请求的多个服务器，以激励最大限度的服务器参与，因此可以抵抗审查和单点故障。我们给出了支持OpenSquare机制设计的博弈论分析：(1)激励服务器与其服务保持可用；(2)最小化客户的外包成本；(3)确保客户以高概率获得有效的计算结果。为了展示实用性，我们还实现了OpenSquare的可靠智能合约，并报告了其所有功能的天然气成本。结果表明，客户端和服务器的链式计算代价都很低，因此在实际部署和使用中是可行的。
Repeated Modular Squaring is a versatile computational operation that has led to practical constructions of timed-cryptographic primitives like time-lock puzzles (TLP) and verifiable delay functions (VDF) that have a fast growing list of applications. While there is a huge interest for timed-cryptographic primitives in the blockchains area, we find two real-world concerns that need immediate attention towards their large-scale practical adoption: Firstly, the requirement to constantly perform computations seems unrealistic for most of the users. Secondly, choosing the parameters for the bound (T) seems complicated due to the lack of heuristics and experience. We present OpenSquare, a decentralized repeated modular squaring service, that overcomes the above concerns. OpenSquare lets clients outsource their repeated modular squaring computation via smart contracts to any computationally powerful servers that offer computational services for rewards in an unlinkable manner.OpenSquare naturally gives us publicly computable heuristics about a pre-specified number (T) and the corresponding reward amounts of repeated squarings necessary for a time period. Moreover, OpenSquare rewards multiple servers for a single request, in a sybil resistant manner to incentivise maximum server participation and is therefore resistant to censorship and single-points-of failures. We give game-theoretic analysis to support the mechanism design of OpenSquare: (1) incentivises servers to stay available with their services, (2) minimizes the cost of outsourcing for the client, and (3) ensures the client receives the valid computational result with high probability. To demonstrate practicality, we also implement OpenSquare's smart contract in Solidity and report the gas costs for all of its functions. Our results show that the on-chain computational costs for both the clients and the servers are quite low, and therefore feasible for practical deployments and usage.
登录
查看更多内容
影响因子：
6.1
作者：
M. Harris;A. Raviv
通讯作者：
M. Harris;A. Raviv
DOI：
10.1007/978-3-642-36594-2_27
发表时间：
2013-03
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Jonathan Katz;U. Maurer;Björn Tackmann;Vassilis Zikas
通讯作者：
Jonathan Katz;U. Maurer;Björn Tackmann;Vassilis Zikas
DOI：
--
发表时间：
2013
期刊：
影响因子：
--
作者：
Vivek Bhattacharya;James W. Roberts;Andrew Sweeting
通讯作者：
Andrew Sweeting
可验证的定时签名变得实用
DOI：
10.1145/3372297.3417263
发表时间：
2020
期刊：
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security
影响因子：
--
作者：
Thyagarajan, Sri Aravinda;Bhat, Adithya;Malavolta, Giulio;Döttling, Nico;Kate, Aniket;Schröder, Dominique
通讯作者：
Schröder, Dominique
同态时间锁谜题及其应用
DOI：
10.1007/978-3-030-26948-7_22
发表时间：
2019
期刊：
影响因子：
--
作者：
Giulio Malavolta;Sri Aravinda Krishnan Thyagarajan
通讯作者：
Sri Aravinda Krishnan Thyagarajan