Converting cryptographic schemes from symmetric to asymmetric bilinear groups

DOI10.1007/978-3-662-44371-2_14zbMATH Open1343.94036OpenAlexW49963507MaRDI QIDQ2874508FDOQ2874508

Authors: Masayuki Abe, Jens Groth, Miyako Ohkubo, Takeya Tango 

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_14

Recommendations

• Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Secure integration of asymmetric and symmetric encryption schemes
• Tools for simulating features of composite order bilinear groups in the prime order setting
• Secure integration of asymmetric and symmetric encryption schemes

zbMATH Keywords

conversionsymmetric bilinear groupsasymmetric bilinear groups

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• A practical compiler for attribute-based encryption: new decentralized constructions and more
• Still wrong use of pairings in cryptography
• Dual system encryption framework in prime-order groups via computational pair encodings
• Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
• Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
• A new technique for compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption

Uses Software

• z3

This page was built for publication: Converting cryptographic schemes from symmetric to asymmetric bilinear groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874508)