Searching for High-Value Rare Events with Uncheatable Grid Computing

DOI10.1007/11496137_9MaRDI QIDQ3593137zbMATH OpenOpenAlexFDO

Authors Wenliang Du, Michael T. Goodrich

Publication date 24 September 2007

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496137_9

zbMATH Keywords

cheatingcryptographic hash functionsGrid computingobfuscationsecurity

Mathematics Subject Classification ID

Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• An event service to support Grid computational environments
• Bounding rare event probabilities in computer experiments
• Rare Event Estimation for Computer Models
• Surprise event detection of the supercomputer execution queues
• Detection of rare events with uncertain outcomes
• LHCb distributed computing and the grid

Cited in

(3)

• scientific article; zbMATH DE number 1617943 (Why is no real title available?)
• Game-theoretic model of a volunteer computing grid
• Pipelined algorithms to detect cheating in long-term grid computations

This page was built for publication: Searching for High-Value Rare Events with Uncheatable Grid Computing

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