Efficient revocation and threshold pairing based cryptosystems
- 13 July 2003
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 163-171
- https://doi.org/10.1145/872035.872059
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Identity-based authenticated key agreement protocol based on Weil pairingElectronics Letters, 2002
- Short Signatures from the Weil PairingLecture Notes in Computer Science, 2001
- Threshold Cryptosystems Secure against Chosen-Ciphertext AttacksLecture Notes in Computer Science, 2001
- RSA-OAEP Is Secure under the RSA AssumptionLecture Notes in Computer Science, 2001
- Identity-Based Encryption from the Weil PairingLecture Notes in Computer Science, 2001
- Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit CertificatesLecture Notes in Computer Science, 2001
- Secure Integration of Asymmetric and Symmetric Encryption SchemesLecture Notes in Computer Science, 1999
- Robust Threshold DSS SignaturesLecture Notes in Computer Science, 1996
- Public-key cryptosystems provably secure against chosen ciphertext attacksPublished by Association for Computing Machinery (ACM) ,1990
- Probabilistic encryptionJournal of Computer and System Sciences, 1984