15 research outputs found
A Constant Time, Single Round Attribute-Based Authenticated Key Exchange in Random Oracle Model
In this paper, we present a single round two-party {\em attribute-based authenticated key exchange} (ABAKE) protocol in the framework of ciphertext-policy attribute-based systems. Since pairing is a costly operation and the composite order groups must be very large to ensure security, we focus on pairing free protocols in prime order groups. The proposed protocol is pairing free, working in prime order group and having tight reduction to Strong Diffie Hellman (SDH) problem under the attribute-based Canetti Krawzyck (CK) model which is a natural extension of the CK model (which is for the PKI-based authenticated key exchange) for the attribute-based setting. The security proof is given in the random oracle model. Our ABAKE protocol does not depend on any underlying attribute-based encryption or signature schemes unlike the previous solutions for ABAKE. Ours is the \textit{first} scheme that removes this restriction. Thus, the first major advantage is that smaller key sizes are sufficient to achieve comparable security. Another notable feature of our construction is that it involves only constant number of exponentiations per party unlike the state-of-the-art ABAKE protocols where the number of exponentiations performed by each party depends on the size of the linear secret sharing matrix. We achieve this by doing appropriate precomputation of the secret share generation. Ours is the \textit{first} construction that achieves this property. Our scheme has several other advantages. The major one being the capability to handle active adversaries. Most of the previous ABAKE protocols can offer security only under passive adversaries. Our protocol recognizes the corruption by an active adversary and aborts the process. In addition to this property, our scheme satisfies other security properties that are not covered by CK model such as forward secrecy, key compromise impersonation attacks and ephemeral key compromise impersonation attacks
Fog based Secure Framework for Personal Health Records Systems
The rapid development of personal health records (PHR) systems enables an
individual to collect, create, store and share his PHR to authorized entities.
Health care systems within the smart city environment require a patient to
share his PRH data with a multitude of institutions' repositories located in
the cloud. The cloud computing paradigm cannot meet such a massive
transformative healthcare systems due to drawbacks including network latency,
scalability and bandwidth. Fog computing relieves the burden of conventional
cloud computing by availing intermediate fog nodes between the end users and
the remote servers. Aiming at a massive demand of PHR data within a ubiquitous
smart city, we propose a secure and fog assisted framework for PHR systems to
address security, access control and privacy concerns. Built under a fog-based
architecture, the proposed framework makes use of efficient key exchange
protocol coupled with ciphertext attribute based encryption (CP-ABE) to
guarantee confidentiality and fine-grained access control within the system
respectively. We also make use of digital signature combined with CP-ABE to
ensure the system authentication and users privacy. We provide the analysis of
the proposed framework in terms of security and performance.Comment: 12 pages (CMC Journal, Tech Science Press
DABKE: Secure deniable attribute-based key exchange framework
National Research Foundation (NRF) Singapor
Cross-Domain Identity-based Matchmaking Encryption
Recently, Ateniese et al. (CRYPTO 2019) proposed a new cryptographic primitive called matchmaking encryption (ME), which provides fine-grained access control over encrypted data by allowing both the sender and receiver to specify access control policies. The encrypted message can be decrypted correctly if and only if the attributes of the sender and receiver simultaneously meet each other\u27s specified policies. In current ME, when users from different organizations need secret communication, they need to be managed by a single-authority center. However, it is more reasonable if users from different domains obtain secret keys from their own authority centers, respectively. Inspired by this, we extend ME to cross-domain scenarios. Specifically, we introduce the concept of the cross-domain ME and instantiate it in the identity-based setting (i.e., cross-domain identity-based ME). Then, we first formulate and design a cross-domain identity-based ME (IB-ME) scheme and prove its privacy and authenticity in the random oracle model. Further, we extend the cross-domain IB-ME to the multi-receiver setting and give the formal definition, concrete scheme and security proof. Finally, we analyze and implement the schemes, which confirms the efficiency feasibility
Attribute-based Key Exchange with General Policies
Attribute-based methods provide authorization to parties based on whether their set of attributes (e.g., age, organization, etc.) fulfills a policy. In attribute-based encryption (ABE), authorized parties can decrypt, and in attribute-based credentials (ABCs), authorized parties can authenticate themselves. In this paper, we combine elements of ABE and ABCs together with garbled circuits to construct attribute-based key exchange (ABKE). Our focus is on an interactive solution involving a client that holds a certificate (issued by an authority) vouching for that client\u27s attributes and a server that holds a policy computable on such a set of attributes. The goal is for the server to establish a shared key with the client but only if the client\u27s certified attributes satisfy the policy. Our solution enjoys strong privacy guarantees for both the client and the server, including attribute privacy and unlinkability of client sessions.
Our main contribution is a construction of ABKE for arbitrary circuits with high (concrete) efficiency. Specifically, we support general policies expressible as boolean circuits computed on a set of attributes. Even for policies containing hundreds of thousands of gates the performance cost is dominated by two pairing computations per policy input. Put another way, for a similar cost to prior ABE/ABC solutions, which can only support small formulas efficiently, we can support vastly richer policies.
We implemented our solution and report on its performance. For policies with 100,000 gates and 200 inputs over a realistic network, the server and client spend 957 ms and 176 ms on computation, respectively. When using offline preprocessing and batch signature verification, this drops to only 243 ms and 97 ms
GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols
In (two-party) privacy-preserving-based applications, two users use encrypted inputs to compute a function without giving out plaintext of their input values. Privacy-preserving computing algorithms have to utilize a large amount of computing resources to handle the encryption-decryption operations. In this dissertation, we study optimal utilization of computing resources on the graphic processor unit (GPU) architecture for privacy-preserving protocols based on secure function evaluation (SFE) and the Elliptic Curve Cryptographic (ECC) and related algorithms. A number of privacy-preserving protocols are implemented, including private set intersection (PSI), secret handshaking (SH), secure Edit distance (ED) and Smith-Waterman (SW) problems. PSI is chosen to represent ECC point multiplication related computations, SH for bilinear pairing, and the last two for SFE-based dynamic programming (DP) problems. They represent different types of computations, so that in-depth understanding of the benefits and limitations of the GPU architecture for privacy preserving protocols is gained.
For SFE-based ED and SW problems, a wavefront parallel computing model on the CPU-GPU architecture under the semi-honest security model is proposed. Low level parallelization techniques for GPU-based gate (de-)garbler, synchronized parallel memory access, pipelining, and general GPU resource mapping policies are developed. This dissertation shows that the GPU architecture can be fully utilized to speed up SFE-based ED and SW algorithms, which are constructed with billions of garbled gates, on a contemporary GPU card GTX-680, with very little waste of processing cycles or memory space.
For PSI and SH protocols and underlying ECC algorithms, the analysis in this research shows that the conventional Montgomery-based number system is more friendly to the GPU architecture than the Residue Number System (RNS) is. Analysis on experiment results further shows that the lazy reduction in higher extension fields can have performance benefits only when the GPU architecture has enough fast memory. The resulting Elliptic curve Arithmetic GPU Library (EAGL) can run 3350.9 R-ate (bilinear) pairing/sec, and 47000 point multiplication/sec at the 128-bit security level, on one GTX-680 card. The primary performance bottleneck is found to be lacking of advanced memory management functions in the contemporary GPU architecture for bilinear pairing operations. Substantial performance gain can be expected when the on-chip memory size and/or more advanced memory prefetching mechanisms are supported in future generations of GPUs
Cryptographic Enforcement of Attribute-based Authentication
Doktorgradsavhandling,This dissertation investigates on the cryptographic enforcement about attributebased
authentication (ABA) schemes. ABA is an approach to authenticate users
via attributes, which are properties of users to be authenticated, environment conditions
such as time and locations. By using attributes in place of usersā identity information,
ABA can provide anonymous authentication, or more specifically, ABA
enables to keep users anonymous from their authenticators. In addition, the property
of least information leakage provides better protection for usersā privacy compared
with public key based authentication approaches. These properties make it possible
to apply ABA schemes in privacy preserving scenarios, for instance, cloud-based
applications.
The most important security requirements of ABA schemes consist of anonymity,
traceability, unforgeability, unlinkability and collision resistance. In this dissertation,
we combine these security requirements with other properties such as hierarchy
to divide ABA schemes into different categories, based on which we use examples
to demonstrate how to construct these schemes cryptographically. The main
contributions of this dissertation include the following aspects:
We categorize ABA schemes into different types and describe their structures
as well as workflows, such that readers can gain a big picture and a clear
view of different ABA schemes and their relations. This categorization serves
as a guideline how to design and construct ABA schemes.
We provide two examples to demonstrate how to construct ciphertext-policy
attribute-based authentication (CP-ABA) schemes via two different approaches.
Different from key-policy attribute-based authentication (KP-ABA) schemes,
attribute keys generated in CP-ABA schemes are comparatively independent
of relations among attributes. Thus compared with KP-ABA, CP-ABA extends
the flexibility and usage scope of ABA schemes.
We extend the core ABA schemes to hierarchical ABA (HABA) schemes
by adding the property of hierarchy. Then we propose two different types
of hierarchical structures, i.e., user related hierarchical ABA (U-HABA) and
attribute related hierarchical ABA (A-HABA). According to these two hierarchical
structures, an example is provided for each type to show how to use
cryptographic primitives to build HABA schemes.
All ABA schemes discussed above and proposed in this dissertation can be implemented
to assist users to achieve anonymous authentication from their authenticators.
Therefore, these schemes can offer more opportunities to protect usersā
privacy, for example, in attribute-based access control (ABAC) and cloud-based
services