Charm: a framework for rapidly prototyping cryptosystems
By Joseph A. Akinyele, Christina Garman, Ian Miers, Matthew W. Pagano, Michael Rushanan, Matthew D. Green, Aviel D. Rubin. Journal of Cryptographic Engineering, 2013
671 citations recorded by the source corpus.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/0658394f2f6d0a4fcacdc92a33ce68c73bd4ebf3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Ian Miers
- Matthew D. Green
- Pedro A. Moreno-Sánchez
- Aniket Kate
- Christina Garman
- Aviel D. Rubin
- Refik Molva
- Giulio Malavolta
Citations in the corpus
- PUDA - Privacy and Unforgeability for Data Aggregation (2015, methodology): “We implemented the verification functionalities of PUDA with the Charm cryptographic framework [1,2].”
- Zerocoin: Anonymous Distributed E-Cash from Bitcoin (2013, methodology): “We used the Charm cryptographic framework [27] to implement the cryptographic constructions in Python, and we used Boost's Python utilities to call that code from within bitcoind.”
- Private and Dynamic Time-Series Data Aggregation with Trust Relaxation (2014, neutral): “N Values [1-10] [1-100] [1-1000]”
- Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability (2019, methodology): “We have used the Charm library [3] for the cryptographic operations.”