Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions

DOI10.1007/978-3-030-64381-2_13zbMATH Open1485.94117OpenAlexW3115952514MaRDI QIDQ2119087FDOQ2119087

Lior Rotem, Gil Segev

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64381-2_13

zbMATH Keywords

algebraic algorithmssecurity reductionsgeneric group modelcryptographic assumptions

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• NIWI and new notions of extraction for algebraic languages
• Rogue-instance security for batch knowledge proofs
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
• Algebraic group model with oblivious sampling
• On pairing-free blind signature schemes in the algebraic group model
• An analysis of the algebraic group model
• Accountability for misbehavior in threshold decryption via threshold traitor tracing

This page was built for publication: Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119087)