Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
type: Item
instance of: scholarly article
title: Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
zbMATH Open document ID: 1401.94142
author: Sanjit Chatterjee
author: M. Prem Laxman Das
author: R. Kabaleeshwaran
published in: Journal of Mathematical Cryptology
publication date: 2018-10-04T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6947346
zbMATH Keywords: pairing-based cryptography
zbMATH Keywords: projecting
zbMATH Keywords: cancelling
zbMATH Keywords: BGN encryption
zbMATH Keywords: ring signature, blind signature
MaRDI profile type: Publication
full work available at URL: jmc-2017-0042
OpenAlex ID: W2888338780
cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
cites work: Pairing-Friendly Elliptic Curves of Prime Order
cites work: Q4434902
cites work: Theory of Cryptography
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4783728
cites work: Conjunctive, Subset, and Range Queries on Encrypted Data
cites work: Compact Group Signatures Without Random Oracles
cites work: Full-Domain Subgroup Hiding and Constant-Size Group Signatures
cites work: Comparing two pairing-based aggregate signature schemes
cites work: On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
cites work: Type 2 Structure-Preserving Signature Schemes Revisited
cites work: Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
cites work: An Algebraic Framework for Diffie-Hellman Assumptions
cites work: Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
cites work: Pairings for cryptographers
cites work: Groth–Sahai Proofs Revisited
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
cites work: Q2739458
cites work: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
cites work: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
cites work: Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
cites work: A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups
cites work: New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
cites work: Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
cites work: Homomorphic Encryption and Signatures from Vector Decomposition
cites work: Hierarchical Predicate Encryption for Inner-Products
cites work: On the (Im)possibility of Projecting Property in Prime-Order Setting
cites work: Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
cites work: Efficient Ring Signatures Without Random Oracles
cites work: Predicate Privacy in Encryption Systems
cites work: Efficient Identity-Based Encryption Without Random Oracles
DOI: 10.1515/JMC-2017-0042
description: scientific article; zbMATH DE number 6947346