jPBC: Java pairing based cryptography

De, Angelo; Iovino, Vincenzo

doi:10.1109/iscc.2011.5983948

Cited by 524 publications

(215 citation statements)

References 11 publications

Supporting

Mentioning

215

Contrasting

Order By: Relevance

“…Our tool is written in Java and it relies on the Java Pairing-Based Cryptography Library (JPBC [12]) to perform all the encryption/decryption operations. While, we use MapDB 3 as the supporting framework for the indexes.…”

Section: Discussionmentioning

confidence: 99%

Self-Enforcing Access Control for Encrypted RDF

et al. 2017

View full text Add to dashboard Cite

Abstract. The amount of raw data exchanged via web protocols is steadily increasing. Although the Linked Data infrastructure could potentially be used to selectively share RDF data with different individuals or organisations, the primary focus remains on the unrestricted sharing of public data. In order to extend the Linked Data paradigm to cater for closed data, there is a need to augment the existing infrastructure with robust security mechanisms. At the most basic level both access control and encryption mechanisms are required. In this paper, we propose a flexible and dynamic mechanism for securely storing and efficiently querying RDF datasets. By employing an encryption strategy based on Functional Encryption (FE) in which controlled data access does not require a trusted mediator, but is instead enforced by the cryptographic approach itself, we allow for fine-grained access control over encrypted RDF data while at the same time reducing the administrative overhead associated with access control management.

show abstract

Section: Discussionmentioning

confidence: 99%

Self-Enforcing Access Control for Encrypted RDF

et al. 2017

View full text Add to dashboard Cite

show abstract

“…We implemented our optimized protocol Π 3 (E) in Java using an open source Java pairing-based cryptography library jPBC [44], which is built on the original C pairing library PBC [42]. Our regular-expression-to-DFA conversion engine is built around the Java dk.brics.automaton library [45].…”

Section: Methodsmentioning

confidence: 99%

Toward practical encrypted email that supports private, regular-expression searches

Wei

Reiter

2014

Int. J. Inf. Secur.

View full text Add to dashboard Cite

In this paper, we develop a protocol to enable private regular-expression searches on encrypted data stored at a server. A novelty of the protocol lies in allowing a user to securely delegate an encrypted search query to a proxy, which interacts with the server where the user's data are stored encrypted to produce the search result for the user. The privacy of the query and the data are both provably protected against an arbitrarily malicious server and an honestbut-curious proxy under rigorous security definitions. We then detail a series of optimizations to our initial design that achieve an order-of-magnitude performance improvement over the original protocol. We demonstrate the practicality of the resulting protocol through measurements of private regular-expression searches on a real-world email dataset.

show abstract

“…To evaluate the performance, we conduct the experiments on 32-bit, 2.10 GHz Pentium Core 2 Duo CPU with Windows 7 machine using Java Pairing based Cryptographic (JPBC) Library [42]. From JPBC Library, we utilize Type A pairing (i.e., 1 × 1 → 2 ) which is based on an elliptic curve ( ) : 2 = 3 + .…”

Section: Empirical Evaluationmentioning

confidence: 99%

Multiuser Searchable Encryption with Token Freshness Verification

Sharma¹,

Jinwala²

2017

Security and Communication Networks

View full text Add to dashboard Cite

A Multiuser Searchable Encryption (MUSE) can be defined with the notion of Functional Encryption (FE) where a user constructs a search token from a search key issued by an Enterprise Trusted Authority (ETA). In such scheme, a user possessing search key constructs search token at any time and consequently requests the server to search over encrypted data. Thus, an FE based MUSE scheme is not suitable for the applications where a log of search activities is maintained at the enterprise site to identify dishonest search query from any user. In addition, none of the existing searchable schemes provides security against token replay attack to avoid reuse of the same token. In this paper, therefore we propose an FE based scheme, Multiuser Searchable Encryption with Token Freshness Verification (MUSE-TFV). In MUSE-TFV, a user prepares one-time usable search token in cooperation with ETA and thus every search activity is logged at the enterprise site. Additionally, by verifying the freshness of a token, the server prevents reuse of the token. With formal security analysis, we prove the security of MUSE-TFV against chosen keyword attack and token replay attack. With theoretical and empirical analysis, we justify the effectiveness of MUSE-TFV in practical applications.

show abstract

jPBC: Java pairing based cryptography

Cited by 524 publications

References 11 publications

Self-Enforcing Access Control for Encrypted RDF

Self-Enforcing Access Control for Encrypted RDF

Toward practical encrypted email that supports private, regular-expression searches

Multiuser Searchable Encryption with Token Freshness Verification

Contact Info

Product

Resources

About