Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
From MaRDI portal
Publication:2874509
DOI10.1007/978-3-662-44371-2_15zbMath1343.94063OpenAlexW2127697876MaRDI QIDQ2874509
Dennis Hofheinz, Carla Ràfols, Andy Rupp, Julia Hesse, Gottfried Herold
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_15
Related Items
Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings, Functional encryption for computational hiding in prime order groups via pair encodings, The Kernel Matrix Diffie-Hellman Assumption, Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems, Simplifying Design and Analysis of Complex Predicate Encryption Schemes, Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis, Reconfigurable Cryptography: A Flexible Approach to Long-Term Security, A Study of Pair Encodings: Predicate Encryption in Prime Order Groups, A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups, Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
