Security and privacy are two indispensable topics withininformation and communication systems. Both rely heavily on thegeneration of high quality cryptographic parameters. Someparameters, such as keys, have the intrinsic requirement that theymust be chosen at random. Others, such as pseudonyms, have theadditional requirement of being system-wide unique. Furthermore, incases where pseudonyms are generated by users themselves, theprivacy of the associated identity must be explicitly protected.Currently, several mechanisms exist that provide either randomnessand privacy or uniqueness. However, no existing solution satisfiesall three requirements while remaining efficient in terms ofcommunication. This book introduces Collision-Free NumberGeneration. Using this concept, an instance within a system canefficiently generate numbers locally, which are provablysystem-wide unique, appear to be random and protect the privacy oftheir generator. Furthermore, approaches are presented that allow aset of instances to jointly generate a secret key which - oncereconstructed - is system-wide unique. The reader should befamiliar with the basics of security and cryptography.
Dr. Martin Schaffer studied computer science at Klagenfurt University and Swiss Federal Institute of Technology, focusing on security and cryptography. While conducting research in these fields, he received his PhD from Klagenfurt University. At present, Dr. Schaffer is working at NXP Semiconductors.
Über den Autor
Dr. Martin Schaffer studied computer science at Klagenfurt University and Swiss Federal Institute of Technology, focusing on security and cryptography. While conducting research in these fields, he received his PhD from Klagenfurt University. At present, Dr. Schaffer is working at NXP Semiconductors.
Klappentext
Security and privacy are two indispensable topics within information and communication systems. Both rely heavily on the generation of high quality cryptographic parameters. Some parameters, such as keys, have the intrinsic requirement that they must be chosen at random. Others, such as pseudonyms, have the additional requirement of being system-wide unique. Furthermore, in cases where pseudonyms are generated by users themselves, the privacy of the associated identity must be explicitly protected. Currently, several mechanisms exist that provide either randomness and privacy or uniqueness. However, no existing solution satisfies all three requirements while remaining efficient in terms of communication. This book introduces Collision-Free Number Generation. Using this concept, an instance within a system can efficiently generate numbers locally, which are provably system-wide unique, appear to be random and protect the privacy of their generator. Furthermore, approaches are presented that allow a set of instances to jointly generate a secret key which - once reconstructed - is system-wide unique. The reader should be familiar with the basics of security and cryptography.
