Secure Commitment Against A Powerful Adversary

Interactive hashing simplifies zero-knowledge protocol design

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes

Designs, Codes and Cryptography

Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Interactive Hashing: An Information Theoretic Tool (Invited Talk)

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security

One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Reducing complexity assumptions for statistically-hiding commitment

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques