Charm: a framework for rapidly prototyping cryptosystems. We describe Charm, an extensible framework for rapidly prototyping cryptographic systems. Charm provides a number of features that explicitly support the development of new protocols, including support for modular composition of cryptographic building blocks, infrastructure for developing interactive protocols, and an extensive library of re-usable code. Our framework also provides a series of specialized tools that enable different cryptosystems to interoperate. We implemented over 40 cryptographic schemes using Charm, including some new ones that, to our knowledge, have never been built in practice. This paper describes our modular architecture, which includes a built-in benchmarking module to compare the performance of Charm primitives to existing C implementations. We show that in many cases our techniques result in an order of magnitude decrease in code size, while inducing an acceptable performance impact. Lastly, the Charm framework is freely available to the research community and to date, we have developed a large, active user base.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Gong, Junqing; Cao, Zhenfu; Tang, Shaohua; Chen, Jie: Extended dual system group and shorter unbounded hierarchical identity based encryption (2016)
- Birrell, Jeremiah; Wilkening, Jon; Rafelski, Johann: Boltzmann equation solver adapted to emergent chemical non-equilibrium (2015)
- Wood, Samuel; Mathewson, James; Joy, Joshua; Stehr, Mark-Oliver; Kim, Minyoung; Gehani, Ashish; Gerla, Mario; Sadjadpour, Hamid; Garcia-Luna-Aceves, J.J.: ICEMAN: a practical architecture for situational awareness at the network edge (2015)
- Chuengsatiansup, Chitchanok; Naehrig, Michael; Ribarski, Pance; Schwabe, Peter: PandA: pairings and arithmetic (2014)