Secret Swarm Unit Reactive k −Secret Sharing

DOI10.1007/978-3-540-77026-8_10zbMath1153.94454OpenAlexW1969591496MaRDI QIDQ5458205

Shlomi Dolev, Limor Lahiani, Mordechai M. Yung

Publication date: 11 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_10

zbMATH Keywords

mobile computingsecret sharing

Mathematics Subject Classification ID

Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Colouring Non-sparse Random Intersection Graphs ⋮ Selected combinatorial problems through the prism of random intersection graphs models ⋮ Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation

Cites Work

• Unnamed Item
• GeoQuorums: implementing atomic memory in mobile ad hoc networks
• Chinese remaindering with errors
• How to share a secret
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• On a class of arithmetic codes and a decoding algorithm (Corresp.)
• Reducibility and Completeness in Private Computations
• Self-stabilizing Mobile Node Location Management and Message Routing

This page was built for publication: Secret Swarm Unit Reactive k −Secret Sharing