One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
Optical computing: a survey for computer scientists
Optical computing: a survey for computer scientists
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to algorithms
Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Self-stabilization
Xor-trees for efficient anonymous multicast and reception
ACM Transactions on Information and System Security (TISSEC)
Secure communications over insecure channels
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Positive Applications of Lattices to Cryptography
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Analysis and optimization of the TWINKLE factoring device
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure communication for RFIDs proactive information security within computational security
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Consider two, not necessarily identical, powerful computers or computer-grids connected by a unidirectional communication link that should transfer a long stream of information in the presence of a listening adversary that is slightly weaker. We present schemes that enhance the computation strength gap between the powerful computers and the adversary. In other words, the gap between the amount of information decrypted by the adversary and the information decrypted by the receiver grows with time. We also suggest schemes based on the shortest vector problem in which only the receivers are computationally powerful. The scheme is self-stabilizing in the sense that it can establish a security level without relying on (previously distributed private keys that are part of) the state. The iterative nested approach suggested, can be used for enhancing the security of the classical protocol of Ralph Merkle [19]. Several applications for sensor networks and for secure communication with survivors are suggested.