Titlebook: Information Security and Cryptology -- ICISC 2012; 15th International C Taekyoung Kwon,Mun-Kyu Lee,Daesung Kwon Conference proceedings 2013

Perceive

fleeting

Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithmsning time of an entire system. Therefore, there is a long list of work on improving its efficiency. It is also true in the context of secure multi-party computation (MPC), and several MPC sorting protocols have been proposed. However, all existing MPC sorting protocols are based on less efficient so

Rotator-Cuff

Provably Secure Certificateless One-Way and Two-Party Authenticated Key Agreement Protocolway and two-party authenticated key agreement protocols and propose a concrete certificateless one-way and two-party authenticated key agreement protocol. The security of our protocol is proven under the computational Diffie-Hellman, square computational Diffie-Hellman and gap bilinear Diffie-Hellma

组成

绑架

Ciphertext Policy Multi-dimensional Range Encryptionc range. In this paper, we propose the notion of (ciphertext-policy) range encryption (RE) that can be used in many of such applications. RE is a type of public key encryption with additional functionality where an encryptor can freely specify a range to a ciphertext so that it can be decrypted only