Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming

DOI10.1007/978-3-662-53015-3_14zbMath1406.94018OpenAlexW2482380280MaRDI QIDQ2829954

Fumitaka Hoshino, Miyako Ohkubo, Masayuki Abe

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

zbMATH Keywords

integer programmingconversionGroth-Sahai proofszero-knowledgebilinear groups

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice

Uses Software

• Gurobi
• LINDO
• z3
• GCG

Cites Work

• Unnamed Item
• Structure-preserving signatures and commitments to group elements
• SCIP: solving constraint integer programs
• On computable isomorphisms in efficient asymmetric pairing-based systems
• Comparing two pairing-based aggregate signature schemes
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• An Algebraic Framework for Diffie-Hellman Assumptions
• Automated Analysis of Cryptographic Assumptions in Generic Group Models
• Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
• Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• Secure Efficient History-Hiding Append-Only Signatures in the Standard Model
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Groth–Sahai Proofs Revisited
• Batch Groth–Sahai
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Traceable Group Encryption
• Fine-Tuning Groth-Sahai Proofs
• Group Signatures with Message-Dependent Opening in the Standard Model
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Theory of Cryptography

This page was built for publication: Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming