Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Cramer, Ronald - Centrum voor Wiskunde en Informatica & Mathematisch Instituut, Universiteit Leiden
ZeroKnowledge Proofs for Finite Field Arithmetic, or: Can ZeroKnowledge be for Free?
Introduction to Secure Computation Ronald Cramer
Linear ZeroKnowledge A Note on Efficient ZeroKnowledge Proofs and Arguments
Signature Schemes Based on the Strong RSA Ronald Cramer
Efficient ZeroKnowledge Proofs of Knowledge Without Intractability Assumptions
New Generation of Secure and Practical RSAbased Signatures
Improved Privacy in Wallets with Observers (Extended Abstract)
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
In European Transactions on Telecommunications 8(5) (September-October 1997) 481{490. A Secure and Optimally Ecient Multi-Authority Election
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
On the Complexity of Verifiable Secret Sharing and Multiparty Computation
A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen
MultiAuthority SecretBallot Elections with Linear Work
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Optimal BlackBox Secret Sharing over Arbitrary Abelian Groups
