Primal implication as encryption

DOI10.1007/978-3-319-06686-8_18MaRDI QIDQ4981162zbMATH OpenOpenAlexFDO

Authors Vladimir Nikolaevich Krupskiĭ

Publication date 24 June 2014

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.6862

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Logic in computer science (03B70)

Abstract: We propose a "cryptographic" interpretation for the propositional connectives of primal infon logic introduced by Y. Gurevich and I. Neeman and prove the corresponding soundness and completeness results. Primal implication $impvarphipsi$ corresponds to the encryption of $psi$ with a secret key $varphi$, primal disjunction $vpvarphipsi$ is a group key and $$ reflects some backdoor constructions such as full superuser permissions or a universal decryption key. For the logic of $$ as a universal key (it was never considered before) we prove that the derivability problem has linear time complexity. We also show that the universal key can be emulated using primal disjunction.

Recommendations

• Primal infon logic with conjunctions as sets
• Transitive primal infon logic
• Logic of infons, the propositional case
• Propositional primal logic with disjunction
• Basic primal infon logic

This page was built for publication: Primal implication as encryption

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