Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GCG / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2482380280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tagged One-Time Signatures: Tight Security and Optimal Tag Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure-preserving signatures and commitments to group elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Analysis of Cryptographic Assumptions in Generic Group Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Groth–Sahai / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing two pairing-based aggregate signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5850736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-Tuning Groth-Sahai Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Framework for Diffie-Hellman Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groth–Sahai Proofs Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Noninteractive Proof Systems for Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Signatures with Message-Dependent Opening in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Efficient History-Hiding Append-Only Signatures in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traceable Group Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computable isomorphisms in efficient asymmetric pairing-based systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Identity-Based Encryption Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions / rank
 
Normal rank

Latest revision as of 22:19, 12 July 2024

scientific article
Language Label Description Also known as
English
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
scientific article

    Statements

    Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2016
    0 references
    0 references
    conversion
    0 references
    bilinear groups
    0 references
    integer programming
    0 references
    Groth-Sahai proofs
    0 references
    zero-knowledge
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references