Abstract

In this paper we present a cryptographic protocol for a seller - buyer problem and in particular we prove that non-emptiness of a semi-commutative set defined by mappings involved in the protocol is a decidable problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call