Optimal reductions of some decisional problems to the rank problem

DOI10.1007/978-3-642-34961-4_7MaRDI QIDQ4911579zbMATH OpenOpenAlexFDO

Authors J. Villar

Publication date 19 March 2013

Published in Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34961-4_7

zbMATH Keywords

algebraic reductionsblack-box reductionsdecision linear problemdecisional Diffie-Hellman problemrank problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Equivalences and black-box separations of matrix Diffie-Hellman problems
• An algebraic framework for Diffie-Hellman assumptions
• Reducible rank codes and their applications to cryptography
• The kernel matrix Diffie-Hellman assumption
• An algebraic framework for Diffie-Hellman assumptions

Cited in

(12)

• Reduction in problem size for ranking alternatives in group decision- making
• On the minimax decision rules in ranking problems
• The magic of ELFs
• The Magic of ELFs
• The kernel matrix Diffie-Hellman assumption
• An algebraic framework for Diffie-Hellman assumptions
• Equivalences and black-box separations of matrix Diffie-Hellman problems
• Use of the Reduced Tolerance Approach to Rank Efficient Solutions
• Rerandomizable garbling, revisited
• Putting multi into multi-signatures: tight security for multiple signers
• Short signatures from DDH without pairings or random oracles
• The malice of ELFs: practical anamorphic-resistant encryption without random oracles

This page was built for publication: Optimal reductions of some decisional problems to the rank problem

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