Charm: a framework for rapidly prototyping cryptosystems

Akinyele, Joseph A.; Garman, Christina; Miers, Ian; Pagano, Matthew W.; Rushanan, Michael; Green, Matthew; Rubin, Aviel D.

doi:10.1007/s13389-013-0057-3

Cited by 527 publications

(225 citation statements)

References 55 publications

Supporting

Mentioning

209

Contrasting

Unclassified

Order By: Relevance

“…Framework We implemented our scheme in Charm [1]; a framework developed to facilitate the rapid prototyping of cryptographic schemes and protocols. It is based on the Python language which allows the programmer to write code similar to the theoretical implementations.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption

Rouselakis

Waters

2015

Lecture Notes in Computer Science

186

167

View full text Add to dashboard Cite

Abstract. We propose an efficient large-universe multi-authority ciphertext-policy attribute-based encryption system. In a large-universe ABE scheme, any string can be used as an attribute of the system, and these attributes are not necessarily enumerated during setup. In a multi-authority ABE scheme, there is no central authority that distributes the keys to users. Instead, there are several authorities, each of which is responsible for the authorized key distribution of a specific set of attributes. Prior to our work, several schemes have been presented that satisfy one of these two properties but not both. Our construction achieves maximum versatility by allowing multiple authorities to control the key distribution for an exponential number of attributes. In addition, the ciphertext policies of our system are sufficiently expressive and overcome the restriction that "each attribute is used only once" that constrained previous constructions. Besides versatility, another goal of our work is to increase efficiency and practicality. As a result, we use the significantly faster prime order bilinear groups rather than composite order groups. The construction is non-adaptively secure in the random oracle model under a non-interactive q-type assumption, similar to one used in prior works. Our work extends existing "program-and-cancel" techniques to prove security and introduces two new techniques of independent interest for other ABE constructions. We provide an implementation and some benchmarks of our construction in Charm, a programming framework developed for rapid prototyping of cryptographic primitives.

show abstract

Section: Implementation and Evaluationmentioning

confidence: 99%

Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption

Rouselakis

Waters

2015

Lecture Notes in Computer Science

186

167

View full text Add to dashboard Cite

show abstract

“…Implementation. We implemented [1] our scheme in Charm [3,2]. Charm is a programming framework that provides cryptographic abstraction in order to build security protocols.…”

Section: Dynamic Group Managementmentioning

confidence: 99%

Private and Dynamic Time-Series Data Aggregation with Trust Relaxation

Leontiadis

Elkhiyaoui

Molva

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. With the advent of networking applications collecting user data on a massive scale, the privacy of individual users appears to be a major concern. The main challenge is the design of a solution that allows the data analyzer to compute global statistics over the set of individual inputs that are protected by some confidentiality mechanism. Joye et al. [8] recently suggested a solution that allows a centralized party to compute the sum of encrypted inputs collected through a smart metering network. The main shortcomings of this solution are its reliance on a trusted dealer for key distribution and the need for frequent key updates. In this paper we introduce a secure protocol for aggregation of timeseries data that is based on the Joye et al.[8] scheme and in which the main shortcomings of the latter, namely, the requirement for key updates and for the trusted dealer are eliminated. Moreover our scheme supports a dynamic group management, whereby as opposed to Joye et al.[8] leave and join operations do not trigger a key update at the users.

show abstract

“…We implemented the verification functionalities of PUDA with the Charm cryptographic framework [1,2]. For pairing computations, it inherits the PBC [13] library which is also written in C. All of our benchmarks are executed on Intel Core i5 CPU M 560 @ 2.67GHz × 4 with 8GB of memory, running Ubuntu 12.04 32bit.…”

Section: Performance Evaluationmentioning

confidence: 99%

PUDA – Privacy and Unforgeability for Data Aggregation

Leontiadis

Elkhiyaoui

Önen

et al. 2015

Cryptology and Network Security

View full text Add to dashboard Cite

Abstract. Existing work on data collection and analysis for aggregation is mainly focused on confidentiality issues. That is, the untrusted Aggregator learns only the aggregation result without divulging individual data inputs. In this paper we extend the existing models with stronger security requirements. Apart from the privacy requirements with respect to the individual inputs, we ask for unforgeability for the aggregate result. We first define the new security requirements of the model. We also instantiate a protocol for private and unforgeable aggregation for multiple independent users. I.e, multiple unsynchronized users owing to personal sensitive information without interacting with each other, contribute their values in a secure way: The Aggregator learns the result of a function without learning individual values, and moreover, it constructs a proof that is forwarded to a verifier that will convince the latter for the correctness of the computation. Our protocol is provably secure in the random oracle model.

show abstract

Charm: a framework for rapidly prototyping cryptosystems

Cited by 527 publications

References 55 publications

Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption

Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption

Private and Dynamic Time-Series Data Aggregation with Trust Relaxation

PUDA – Privacy and Unforgeability for Data Aggregation

Contact Info

Product

Resources

About