TY - GEN
T1 - Maintaining security in the presence of transient faults
AU - Canetti, Ran
AU - Herzberg, Amir
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.
PY - 1994
Y1 - 1994
N2 - Consider a multiparty system where parties may occasionally be “infected” by malicious, coordinated agents, called viruses. After some time the virus is expelled and the party wishes to regain its security. Since the leaving virus knows the entire contents of the infected party’s memory, a source of “fresh” randomness seems essential for regaining security (e.g., for selecting new keys). However, such an “on-line” source of randomness may not be always readily available. We describe a scheme which, using randomness only at the beginning of the computation, supplies each party with a new pseudorandom number at each round of communication. Each generated number is unpredictable by an adversary controlling the viruses, even if the party was infected in previous rounds. Our scheme is valid as long as in each round there is at least one noninfected party, and some of the communication links are secure. We describe an important application of our scheme to secure sign-on protocols.
AB - Consider a multiparty system where parties may occasionally be “infected” by malicious, coordinated agents, called viruses. After some time the virus is expelled and the party wishes to regain its security. Since the leaving virus knows the entire contents of the infected party’s memory, a source of “fresh” randomness seems essential for regaining security (e.g., for selecting new keys). However, such an “on-line” source of randomness may not be always readily available. We describe a scheme which, using randomness only at the beginning of the computation, supplies each party with a new pseudorandom number at each round of communication. Each generated number is unpredictable by an adversary controlling the viruses, even if the party was infected in previous rounds. Our scheme is valid as long as in each round there is at least one noninfected party, and some of the communication links are secure. We describe an important application of our scheme to secure sign-on protocols.
UR - http://www.scopus.com/inward/record.url?scp=84984842401&partnerID=8YFLogxK
U2 - 10.1007/3-540-48658-5_38
DO - 10.1007/3-540-48658-5_38
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84984842401
SN - 9783540583332
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 425
EP - 438
BT - Advances in Cryptology — CRYPTO 1994 - 14th Annual International Cryptology Conference, Proceedings
A2 - Desmedt, Yvo G.
PB - Springer Verlag
T2 - 14th Annual International Cryptology Conference, CRYPTO 1994
Y2 - 21 August 1994 through 25 August 1994
ER -