Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
From MaRDI portal
Publication:2829954
DOI10.1007/978-3-662-53015-3_14zbMATH Open1406.94018OpenAlexW2482380280MaRDI QIDQ2829954FDOQ2829954
Authors: Masayuki Abe, Fumitaka Hoshino, Miyako Ohkubo 
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_14
Recommendations
- Converting cryptographic schemes from symmetric to asymmetric bilinear groups
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Tools for simulating features of composite order bilinear groups in the prime order setting
- On the (Im)possibility of projecting property in prime-order setting
- Type 2 structure-preserving signature schemes revisited
Cites Work
- SCIP: solving constraint integer programs
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- 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
- Theory of Cryptography
- Structure-preserving signatures and commitments to group elements
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Tagged one-time signatures: tight security and optimal tag size
- Advances in Cryptology – CRYPTO 2004
- Efficient noninteractive proof systems for bilinear groups
- Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
- Applied integer programming. Modeling and solution.
- Comparing two pairing-based aggregate signature schemes
- An algebraic framework for Diffie-Hellman assumptions
- Batch Groth-Sahai
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- On computable isomorphisms in efficient asymmetric pairing-based systems
- Automated analysis of cryptographic assumptions in generic group models
- Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
- Converting cryptographic schemes from symmetric to asymmetric bilinear groups
- Traceable group encryption
- Fine-Tuning Groth-Sahai Proofs
- Groth–Sahai Proofs Revisited
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Group signatures with message-dependent opening in the standard model
- Secure efficient history-hiding append-only signatures in the standard model
Cited In (5)
- A simple and efficient framework of proof systems for NP
- Curves with Fast Computations in the First Pairing Group
- SCRAPE: scalable randomness attested by public entities
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Converting cryptographic schemes from symmetric to asymmetric bilinear groups
Uses Software
This page was built for publication: Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829954)
