Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
Commodity-based cryptography (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Tight security proofs for the bounded-storage model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
Journal of Cryptology
RFID: Applications, Security, and Privacy
RFID: Applications, Security, and Privacy
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Hi-index | 0.00 |
In this paper, we discuss the conceptual problems arising from security issues for small artefacts. We propose two frameworks for security of small artefacts and present some preliminary results for the two frameworks.