Institute for Inforcomm Research

Singapore, Singapore

Institute for Inforcomm Research

Singapore, Singapore
SEARCH FILTERS
Time filter
Source Type

Chia Y.-K.,Institute for Inforcomm Research | Sun S.,Institute for Inforcomm Research | Zhang R.,Institute for Inforcomm Research | Zhang R.,National University of Singapore
IEEE Wireless Communications and Networking Conference, WCNC | Year: 2013

In this paper, we propose a model for energy cooperation between cellular base stations (BSs) with individual renewable energy sources, limited energy storages and connected by resistive power lines for energy sharing. When the renewable energy profile and energy demand profile at all BSs are deterministic or known ahead of time, we show that the optimal energy cooperation policy for the BSs can be found by solving a linear program. We show the benefits of energy cooperation in this regime. When the renewable energy and demand profiles are stochastic and only causally known at the BSs, we propose an online energy cooperation algorithm and show the optimality properties of this algorithm under certain conditions. Furthermore, the energy-saving performances of the developed offline and online algorithms are compared by simulations, and the effect of the availability of energy state information (ESI) on the performance gains of the BSs' energy cooperation is investigated. © 2013 IEEE.


Sun M.,Institute for Inforcomm Research | Zhang Y.P.,Nanyang Technological University
Asia-Pacific Microwave Conference Proceedings, APMC | Year: 2010

This paper presents the design of a microstrip grid array antenna and more importantly describes the integration of it into a grid array package in a low temperature cofired ceramic (LTCC) technology for highly-integrated 60-GHz radios. The grid array antenna package has a small volume of 13.581.265 mm 3 and can house a 60-GHz radio die of current size. The microstrip grid array antenna package samples were fabricated and measured. Measured results show good agreement with simulated ones. It achieved good matching (S11=≤-10 dB), high efficiency (85%), and directional patterns with the main beam in the boresight direction from 57 to 64 GHz as well as high gain with the peak value of 14.5 dBi at 60 GHz. © 2010 IEICE Institute of Electronics Informati.


Peng K.,Institute for Inforcomm Research
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings | Year: 2011

The two most recent PVSS (publicly verifiable secret sharing) schemes are illustrated to be vulnerable to a simple attack. Moreover, one of them has to deteriorate its efficiency greatly to meet practical security requirement. The attack makes the share holders to receive incorrect shares, which will lead secret reconstruction to mistake. The efficiency deterioration is so serious that no practical application can tolerate it. So the two most recent PVSS schemes actually cannot work reliably and efficiently as they claim. © 2011 IEEE.


Peng K.,Institute for Inforcomm Research
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings | Year: 2011

A new secret-sharing-based e-auction scheme is proposed. Distributed bid opening is employed to protect bid privacy. It can achieve all the desired properties for sealed-bid auctions at a reasonable cost. Moreover, attacks existing in the current secret-sharing-based sealed-bid e-auction schemes are prevented in the new scheme. In addition, it does not need any trust assumption. © 2011 IEEE.


Lee L.,Institute for Inforcomm Research | Aw A.,Institute for Inforcomm Research | Zhang M.,Institute for Inforcomm Research | Li H.,Institute for Inforcomm Research
Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference | Year: 2010

In this paper, we present an unsupervised hybrid model which combines statistical, lexical, linguistic, contextual, and temporal features in a generic EM-based framework to harvest bilingual terminology from comparable corpora through comparable document alignment constraint. The model is configurable for any language and is extensible for additional features. In overall, it produces considerable improvement in performance over the baseline method. On top of that, our model has shown promising capability to discover new bilingual terminology with limited usage of dictionaries.


Bao F.,Institute for Inforcomm Research
2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010 | Year: 2010

Digital signature is very critical and useful for achieving security features such as authentication, certification, integrity and non-repudiation etc. In digital signature schemes, private keys play the most fundamental role of security and trust. Once a private key is compromised, the key owner loses all of the protection to himself so that he can be impersonated. Hence it is crucial for a private key owner to know whether his key has been stolen. The first study toward detecting private key disclosure is [4], where the schemes based on the time-division and private key updating are presented. The approach is similar to the forward-secure signature in the key-update style. In this paper we propose a completely different approach for a user to detect whether his private key for signing digital signatures is compromised. The solution satisfies the four attractive properties: 1) the user need not possess another cryptographic key and what he has are his private key and a memorable password; 2) the signature schemes are not in the update of the private key in time-divided manner and our method can be applied to the existing signature schemes; 3) although a trusted party (TP) is required in our method, the user and the TP need not share any secret; and 4) the user is stateless, i.e., he does not need to record all the messages and the signatures he has signed before.


Peng K.,Institute for Inforcomm Research
Journal of Information Processing Systems | Year: 2013

A new secure network communication technique that has been designed for mobile wireless services, is presented in this paper. Its network services are mobile, distributed, seamless, and secure. We focus on the security of the scheme and achieve anonymity and reliability by using cryptographic techniques like blind signature and the electronic coin. The question we address in this paper What, "is is the best way to protect the privacy and anonymity of users of mobile wireless networks, especially in practical applications like e-commerce?" The new scheme is a flexible solution that answers this question. It efficiently protects user's privacy and anonymity in mobile wireless networks and supports various applications. It is employed to implement a secure e-auction as an example, in order to show its advantages in practical network applications. © 2013 KIPS.


Peng K.,Institute for Inforcomm Research
Journal of Information Processing Systems | Year: 2012

PVSS stands for publicly verifiable secret sharing. In PVSS, a dealer shares a secret among multiple share holders. He encrypts the shares using the shareholders' encryption algorithms and publicly proves that the encrypted shares are valid. Most of the existing PVSS schemes do not employ an ElGamal encryption to encrypt the shares. Instead, they usually employ other encryption algorithms like a RSA encryption and Paillier encryption. Those encryption algorithms do not support the shareholders' encryption algorithms to employ the same decryption modulus. As a result, PVSS based on those encryption algorithms must employ additional range proofs to guarantee the validity of the shares obtained by the shareholders. Although the shareholders can employ ElGamal encryptions with the same decryption modulus in PVSS such that the range proof can be avoided, there are only two PVSS schemes based on ElGamal encryption. Moreover, the two schemes have their drawbacks. One of them employs a costly repeating-proof mechanism, which needs to repeat the dealer's proof at least scores of times to achieve satisfactory soundness. The other requires that the dealer must know the discrete logarithm of the secret to share and thus weakens the generality and it cannot be employed in many applications. A new PVSS scheme based on an ElGamal encryption is proposed in this paper. It employs the same decryption modulus for all the shareholders' ElGamal encryption algorithms, so it does not need any range proof. Moreover, it is a general PVSS technique without any special limitation. Finally, an encryption-improving technique is proposed to achieve very high efficiency in the new PVSS scheme. It only needs a number of exponentiations in large cyclic groups that are linear in the number of the shareholders, while all the existing PVSS schemes need at least a number of exponentiations in large cyclic groups that are linear in the square of the number of the shareholders © 2012 KIPS.


Peng K.,Institute for Inforcomm Research
Journal of Information Processing Systems | Year: 2012

Shuffling is an effective method to build a publicly verifiable mix network to implement verifiable anonymous channels that can be used for important cryptographic applications like electronic voting and electronic cash. One shuffling scheme by Groth is claimed to be secure and efficient. However, its soundness has not been formally proven. An attack against the soundness of this shuffling scheme is presented in this paper. Such an attack compromises the soundness of the mix network based on it. Two new shuffling protocols are designed on the basis of Groth's shuffling and batch verification techniques. The first new protocol is not completely sound, but is formally analyzed in regards to soundness, so it can be applied to build a mix network with formally proven soundness. The second new protocol is completely sound, so is more convenient to apply. Formal analysis in this paper guarantees that both new shuffling protocols can be employed to build mix networks with formally provable soundness. Both protocols prevent the attack against soundness in Groth's scheme. Both new shuffling protocols are very efficient as batch-verification-based efficiency-improving mechanisms have been adopted. The second protocol is even simpler and more elegant than the first one as it is based on a novel batch cryptographic technique. © 2012 KIPS.


Peng K.,Institute for Inforcomm Research
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

A new range proof scheme is proposed in this paper. We study a related technique, range test, and show how its idea can be used to design a more advanced range proof technique. The main advantage of the new range proof technique over the existing solutions is that it achieves the best trade-off between soundness, privacy and efficiency. Is achieves information-theoretic and absolutely precise soundness and thus is more secure than those range proof schemes with conditional soundness. It achieves formally provable zero knowledge in privacy and thus is more secure than those range proof schemes without formally proven zero knowledge. It only needs a small constant number of computations and employs normal-length parameters and thus is more efficient than those range proof schemes needing super-linear cost or extra large integers. © 2011 Springer-Verlag.

Loading Institute for Inforcomm Research collaborators
Loading Institute for Inforcomm Research collaborators