A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Handbook of theoretical computer science (vol. B)
Faster uniquely represented dictionaries
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Incremental cryptography and application to virus protection
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
How To Break and Repair A "Provably Secure" Untraceable Payment System
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Incremental Cryptography: The Case of Hashing and Signing
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Characterizing History Independent Data Structures
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Incremental Unforgeable Encryption
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Integrating security across the computer science curriculum
Journal of Computing Sciences in Colleges
Lower and upper bounds on obtaining history independence
Information and Computation
Threats to privacy in the forensic analysis of database systems
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Uniquely Represented Data Structures for Computational Geometry
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
B-Treaps: A Uniquely Represented Alternative to B-Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Lower and upper bounds on obtaining history independence
Information and Computation
A new paradigm for collision-free hashing: incrementality at reduced cost
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Incremental cryptography and memory checkers
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
IEEE Transactions on Information Technology in Biomedicine
Fair and dynamic proofs of retrievability
Proceedings of the first ACM conference on Data and application security and privacy
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
History-independence: a fresh look at the case of R-trees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Incremental deterministic public-key encryption
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Deterministic history-independent strategies for storing information on write-once memories
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Towards fully incremental cryptographic schemes
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
HIFS: history independence for file systems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Efficient sampling of non-strict turnstile data streams
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |