Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
From MaRDI portal
Publication:1787193
DOI10.1515/jmc-2017-0042zbMath1401.94142OpenAlexW2888338780MaRDI QIDQ1787193
M. Prem Laxman Das, R. Kabaleeshwaran, Sanjit Chatterjee
Publication date: 4 October 2018
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2017-0042
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparing two pairing-based aggregate signature schemes
- Pairings for cryptographers
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Type 2 Structure-Preserving Signature Schemes Revisited
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- An Algebraic Framework for Diffie-Hellman Assumptions
- Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups
- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Groth–Sahai Proofs Revisited
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Compact Group Signatures Without Random Oracles
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Homomorphic Encryption and Signatures from Vector Decomposition
- Predicate Privacy in Encryption Systems
- Hierarchical Predicate Encryption for Inner-Products
- On the (Im)possibility of Projecting Property in Prime-Order Setting
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Pairing-Friendly Elliptic Curves of Prime Order
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Theory of Cryptography
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Efficient Ring Signatures Without Random Oracles
- Theory of Cryptography
