The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences announces a forthcoming Special Section on Networked Control Systems: Theories & Applications to be published in May 2013. In many applications, such as factory automation and smart grid, Networked Control System (NCS) plays an important role, in which the state of environment is monitored and the target is controlled both via the network. Based on conventional control and communication theories, a new unified theory on NCS is needed to realize reliable, robust, delay tolerant, and scalable communication networks for NCS. Under these considerations, Special Section on Networked Control Systems: Theories & Applications is planned to accelerate R&D activities in this area by collecting and publishing the results on up-to-date researches and experimental studies related to NCS.

IEICE transactions on fundamentals of electronics, communications and computer sciences

Recently, a number of extended Proxy Re-Encryptions (PRE), e.g. Conditional (CPRE), identity-based PRE (IPRE) and broadcast PRE (BPRE), have been proposed for flexible applications. By incorporating CPRE, IPRE and BPRE, this paper proposes a versatile primitive referred to as conditional identity-based broadcast PRE (CIBPRE) and formalizes its semantic security. CIBPRE allows a sender to encrypt a message to multiple receivers by specifying these receivers’ identities, and the sender can delegate a re-encryption key to a proxy so that he can convert the initial ciphertext into a new one to a new set of intended receivers. Moreover, the re-encryption key can be associated with a condition such that only the matching ciphertexts can be re-encrypted, which allows the original sender to enforce access control over his remote ciphertexts in a fine-grained manner. We propose an efficient CIBPRE scheme with provable security. In the instantiated scheme, the initial ciphertext, the re-encrypted ciphertext and the re-encryption key are all in constant size, and the parameters to generate a re-encryption key are independent of the original receivers of any initial ciphertext. Finally, we show an application of our CIBPRE to secure cloud email system advantageous over existing secure email systems based on Pretty Good Privacy protocol or identity-based encryption.

Conditional Identity-Based Broadcast Proxy Re-Encryption and Its Application to Cloud Email

Session I: Algebraic and Number Theoretical Cryptanalysis (I).- Total Break of the ?-IC Signature Scheme.- Recovering NTRU Secret Key from Inversion Oracles.- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?.- Session II: Theory of Public Key Encryption.- Relations Among Notions of Plaintext Awareness.- Completely Non-malleable Encryption Revisited.- Invited Talk I.- Cryptographic Test Correction.- Session III: Digital Signatures (I).- Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results.- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures.- Proxy Signatures Secure Against Proxy Key Exposure.- Session IV: Identification, Broadcast and Key Agreement.- Lattice-Based Identification Schemes Secure Under Active Attacks.- Efficient Simultaneous Broadcast.- SAS-Based Group Authentication and Key Agreement Protocols.- Session V: Implementation of Fast Arithmetic.- An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm.- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields.- Session VI: Digital Signatures (II).- Online-Untransferable Signatures.- Security of Digital Signature Schemes in Weakened Random Oracle Models.- A Digital Signature Scheme Based on CVP ???.- Session VII: Algebraic and Number Theoretical Cryptanalysis (II).- An Analysis of the Vector Decomposition Problem.- A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents.- Session VIII: Public Key Encryption.- Certificateless Encryption Schemes Strongly Secure in the Standard Model.- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption.- Public Key Broadcast Encryption with Low Number of Keys and Constant Decryption Time.

Public key cryptography -- PKC 2008 : 11th International Workshop on Practice and Theory in Public Key Cryptography, Barcelona, Spain, March 9-12, 2008 : proceedings

https://ro.uow.edu.au/cgi/viewcontent.cgi?article=1299&context=eispapers

Identity-based data storage in cloud computing

In this paper, we present the first generic construction of a chosen-ciphertext (CCA) secure uni-directional proxy re-encryption (PRE) scheme. In particular, full CCA security (i.e., not relaxed CCA security such as replayable CCA security) of our proposed scheme is proven even against powerful adversaries that are given a more advantageous attack environment than in all previous works, and furthermore, random oracles are not required. To achieve such strong security, we establish a totally novel methodology for designing PRE based on a specific class of threshold encryption. Via our generic construction, we present the first construction that is CCA secure in the standard model.

Generic construction of chosen ciphertext secure proxy re-encryption

Proxy re-encryption (PRE) is a cryptographic application proposed by Blaze, Bleumer, and Strauss. It is an encryption system with a special property in which the semi-honest third party, the proxy, can re-encrypt ciphertexts for Alice into other ciphertexts for Bob without using Alice’s secret key. We can classify PRE into bidirectional and unidirectional schemes. Canetti and Hohenberger formalized the semantic security under chosen ciphertext attack for PRE, the PRE-CCA security. Several schemes satisfy the PRE-CCA security as a bidirectional or unidirectional scheme. However, some PRE schemes need a bilinear map in the standard model, and the other PRE schemes are PRE-CCA secure in the random oracle model before our work. In this paper, we construct a bidirectional PRE-CCA proxy re-encryption without bilinear maps in the standard model. We study lossy trapdoor functions (LTDFs) based on the decisional Diffie-Hellman (DDH) assumption proposed by Peikert and Waters. We define a new variant of LTDFs, re-applicable LTDFs, which are specialized LTDFs for PRE, and use them for our scheme.

/pdf/cca-proxy-re-encryption-without-bilinear-maps-in-the-19u0jusfug.pdf

CCA proxy re-encryption without bilinear maps in the standard model

The tag-KEM/DEM framework has been proposed by Abe, Gennaro, Kurosawa, and Shoup to explain why the Kurosawa-Desmedt PKE is secure in the sense of IND-CCA2, yet the KEM part are not secure in the sense of IND-CCA2. They have concluded that the Kurosawa-Desmedt KEM satisfies the IND-CCA2 security for tag-KEM. They have shown that an IND-CCA2 secure PKE system can be constructed from an IND-CCA2 tag-KEM system and an IND-OT secure DEM system.

Herranz, Hofheinz and Kiltz have shown the necessary and sufficient conditions for the KEM/DEM framework. They also have studied implications and separations among the security notions of KEM.

In this paper, we study the necessary and sufficient conditions for the tag-KEM/DEM framework. Moreover, we study implications and separations among the security notions of tag-KEM. By these studies, we show gaps between KEM and tag-KEM about weak and strong non-malleability with respect to the necessary and sufficient conditions in order to obtain the same security levels.

Toshihide Matsuda

Papers

CCA proxy re-encryption without bilinear maps in the standard model

Security on Hybrid Encryption with the Tag-KEM/DEM Framework