The way we apply Shamir’s threshold scheme for secret sharing was described in Sect. 13.4. Having several parallel schemes, one for each identity in a disclosure context, can lead to incorrect pseudonym disclosure, denoted as mismatches. The mismatch problem is defined in Sect. 14.1 and the probability of its occurrence is given in Sect. 14.2. Though for sensibly chosen parameters the probability of mismatches is negligible, mismatches may be strictly inacceptable in certain applications. Two complementary solutions are discussed in Sect. 14.3 as well as described in Sect. 14.3.1 and Sect. 14.3.2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). The Mismatch Problem. In: Privacy-Respecting Intrusion Detection. Advances in Information Security, vol 35. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68254-9_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-68254-9_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34346-4
Online ISBN: 978-0-387-68254-9
eBook Packages: Computer ScienceComputer Science (R0)