Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Abstract. The need for secure logging is well-understood by the security professionals, including both researchers and practitioners. The ability to efficiently verify all (or some...
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...