Charm: a framework for rapidly prototyping cryptosystems
Top Cited Papers
- 7 March 2013
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Cryptographic Engineering
- Vol. 3 (2), 111-128
- https://doi.org/10.1007/s13389-013-0057-3
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Efficient Non-interactive Proof Systems for Bilinear GroupsPublished by Springer Science and Business Media LLC ,2008
- Batch Verification of Short SignaturesLecture Notes in Computer Science, 2007
- Mesh SignaturesLecture Notes in Computer Science, 2007
- Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based EncryptionLecture Notes in Computer Science, 2005
- Signature Schemes and Anonymous Credentials from Bilinear MapsLecture Notes in Computer Science, 2004
- Efficient Selective-ID Secure Identity-Based Encryption Without Random OraclesLecture Notes in Computer Science, 2004
- Chosen-Ciphertext Security from Identity-Based EncryptionLecture Notes in Computer Science, 2004
- Nonmalleable CryptographySIAM Journal on Computing, 2000
- Efficient group signature schemes for large groupsLecture Notes in Computer Science, 1997
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991