Uncheatable Distributed Computations

By Philippe Golle, Ilya Mironov. 2001

282 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Geppetto: Versatile Verifiable Computation (2015, background): “Prior work on verifying computation focused on narrow classes of computation [32, 51], relied on physical-security assumptions [41, 47], assumed uncorrelated failures [19, 20], or achieved good asymptotics [2, 28, 30, 31, 33, 38, 44] but impractical concrete performance [46, 50].”
Pinocchio: Nearly Practical Verifiable Computation (2013, background): “Function speciﬁc solutions [2–6] are often efﬁcient, but only for a narrow class of computations.”
Verifying computations with state (2013, background): “2522733 the remote hardware and use attestation [60, 63], but what if the hardware is faulty? The client could use a tailored solution [8, 13, 18, 28, 39, 58, 70, 73, 75], but such solutions are not available for all applications.”
Uncheatable Reputation for Distributed Computation Markets (2006, methodology): “Our solution is composed of two major elements: a proof of computation method (an extension of the “ringer” concept first introduced in [13]) and a “threshold witnessing” mechanism.”
Verifiable Delegation of Computation over Large Datasets (2011, background): “Other work targets specific function classes, such as one-way function inversion [32].”
Secure Remote Execution of Sequential Computations (2009, methodology): “Similar to [4], [5], [10], we do not consider the case where a malicious participant cheats only once in an attempt to disturb the computations (for personal gain or to achieve some e.”
Query Execution Assurance for Outsourced Databases (2005, background): “For one challenge token ( r = 1 ), measured execution time overheads varied decreased slightly with increasing segment sizes as can be seen in Figure 8 (b).”
Searching for High-Value Rare Events with Uncheatable Grid Computing (2005, methodology): “Golle and Mironov also discuss some ways to augment this basic ringer scheme—using bogus ringers to prevent participants from knowing the total number of ringers planted and magic sets to prevent direct images from being sent to the participants.”
Securely Outsourcing Attribute-Based Encryption with Checkability (2014, methodology): “Moreover, we use the idea of ''ringer'' [5] and appending redundancy to fight against the dishonest actions of KGSPs and DSP.”
How to Use Bitcoin to Design Fair Protocols (2014, background): “The works of [52, 17] design a credit system where users are rewarded for good work and fined for cheating (assuming a trusted arbiter/supervisor in some settings).”
Security and privacy for storage and computation in cloud computing (2014, background): “[17] proposed a ringer scheme in distributed computing where the supervisor sent to the participant some pre-computed results without disclosing the corresponding inputs.”
Secure Distributed Computing in a Commercial Environment (2002, background): “An idea common to many schemes is to spot-check computations at random (see for example [ GM00 ]).”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, background): “Since the servers (or workers) are not trusted by the outsourcers, Golle and Mironov [33] first introduced the concept of ringers to solve the trust problem of verifying computation completion.”
Making argument systems for outsourced computation practical (sometimes) (2012, unknown): “Golle [40] outsources the inversion of one-way functions, and Karame et al.”
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (2010, background): “Other work targets specific function classes, s uch as one-way function inversion [15].”
Practical delegation of computation using multiple servers (2011, background): “[21] for computations that have short intermediate states, or, [13] for functions with easy to sample domains) and there are several works that use trusted hardware that allow almost any type of computation (e.”
Pors: proofs of retrievability for large files (2007, methodology): “The use of sentinels in our main scheme is similar is spirit to a number of other systems that rely on the embedding of secret check values in files, such as the “ringers” used in [20].”