A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
"Pseudorandom Intermixing": A Tool for Shared Cryptography
[chapter]
2000
Lecture Notes in Computer Science
Designing distributed cryptographic protocols that combine correctness, security, efficiency and practical constraints can be very difficult. Here, we suggest a new modular tool that we call "pseudorandom intermixing" which allows parties (or architectural components, such as hardware devices) sharing pseudorandomness to mix extra correlated pseudorandom information inside their computational results. We show how the pseudorandom intermixing may ease the design, increase efficiency and allow
doi:10.1007/978-3-540-46588-1_21
fatcat:4bk7n5hyd5a5hf6bekpx6ilcfe