There is no safe pairing function over an arbitrary structure

DOI10.1002/MALQ.200610003zbMATH Open1095.03033OpenAlexW2004675812MaRDI QIDQ5485489FDOQ5485489

Authors: Olga Xirotiri 

Publication date: 30 August 2006

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200610003

Recommendations

• Pairing-based cryptography and its security analysis
• Pairing-based cryptography and its security analysis
• Provably secure non-interactive key distribution based on pairings
• Impossibility of simulation secure functional encryption even with random oracles
• Cryptography and Coding
• Pairing-based non-interactive zero-knowledge proofs
• scientific article; zbMATH DE number 1952894
• On Constructing Pairing-Free Identity-Based Encryptions
• Fault Attacks on Pairing-Based Protocols: Revisited

zbMATH Keywords

safe recursionRecursion theorypairing functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Title not available (Why is that?)

Cited In (2)

• Simulation of simultaneous safe recursion over an arbitrary structure
• Minimum-complexity pairing functions

This page was built for publication: There is no safe pairing function over an arbitrary structure

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