Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Damgård, Ivan - Department of Computer Science, Aarhus Universitet
A Generalisation, a Simplification and some Applications of Paillier's Probabilistic
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant
Efficient ZeroKnowledge Proofs of Knowledge Without Intractability Assumptions ?
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
E#cient Concurrent ZeroKnowledge in the Auxiliary String Model
An Integer Commitment Scheme based on Groups with Hidden Order
An E#cient PseudoRandom Generator with Applications to PublicKey Encryption and ConstantRound Multiparty
Multiparty Computation from Threshold Homomorphic Encryption
General Secure MultiParty Computation from any Linear SecretSharing Scheme
Practical Threshold RSA Signatures Without a Trusted Ivan Damgard and Maciej Koprowski
Improved NonCommitting Encryption Schemes based on a General Complexity Assumption
