نتایج جستجو برای: random key pre

تعداد نتایج: 1106434  

2016
Chunpeng Ge Jiandong Wang Liming Fang

In a conditional proxy re-encryption (C-PRE) scheme, a semi-trusted proxy can transform Alice’s ciphertext into Bob’s ciphertext without learning the underlying plaintext, if the ciphertext satisfies a certain condition. To achieve more fine-grained delegation on conditions, Fang, Wang and Ge introduced the notion of fuzzy conditional proxy re-encryption (FC-PRE), whereby the conditions is view...

Journal: :RFC 2005
Pasi Eronen Hannes Tschofenig

Status of This Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract This document specifies three se...

2010
Anup Kumar K. Anup Kumar

Problem statement: The strength of the block ciphers depend on the degree of confusion and diffusion induced in the cipher. Most of the transformations used for this purpose are well known to every one and can be broken by a crypt analyzer. Therefore, in order to counter attack the crypt analyzer, there is a need for better transformations in addition to the existing one. Approach: We tried to ...

Journal: :CoRR 2016
Syed Mehedi Hasan Nirob Md. Kazi Nayeem Md. Saiful Islam

 Categorization Abstract: Trending topic of newspapers is an indicator to understand the situation of a country and also a way to evaluate the particular newspaper. This paper represents a model describing few techniques to select trending topics from Bangla Newspaper. Topics that are discussed more frequently than other in Bangla newspaper will be marked and how a very famous topic loses its ...

Journal: :CoRR 2015
Anjana Ambika Mahesh B. Sundar Rajan

This paper discusses noisy index coding problem over Gaussian broadcast channel. We propose a technique for mapping the index coded bits to M-QAM symbols such that the receivers whose side information satisfies certain conditions get coding gain, which we call the QAM side information coding gain. We compare this with the PSK side information coding gain, which was discussed in [1]. Keywords—In...

2003
D. Le Guen

This paper deals with a new modulation recognition algorithm based on an analysis of time-frequency representations of di erent modulated signals (PSK, QAM and FSK). At rst, we conduct experimental studies over a range of time-frequency representations (TFR) in order to choose the more appropriated one. Once, an appropriated TFR has been chosen, some statistical functions applied on that TFR ar...

Journal: :CoRR 2012
Emna Ben Slimane Slaheddine Jarboui Ammar Bouallègue

This paper introduces a novel blind carrier phase recovery estimator for general 2π/M-rotationally symmetric constellations. This estimation method is a generalization of the non-data-aided (NDA) nonlinear Phase Metric Method (PMM) estimator already designed for general quadrature amplitude constellations. This unbiased estimator is seen here as a fourth order PMM then generalized to M th order...

2006
Katrin Hoeper Guang Gong

Recently, identity-based cryptographic (IBC) schemes have been considered to secure mobile ad hoc networks (MANETs) due to their efficient key management properties. However, proposed schemes do not provide mechanisms for key revocation and key renewal. In this paper, we propose the first key revocation and key renewal mechanisms for IBC schemes that are especially designed for MANETs. In our f...

Journal: :IACR Cryptology ePrint Archive 2015
Benjamin Dowling Douglas Stebila Gregory M. Zaverucha

The Network Time Protocol (NTP) is used by many network-connected devices to synchronize device time with remote servers. Many security features depend on the device knowing the current time, for example in deciding whether a certificate is still valid. Currently, most services implement NTP without authentication, and the authentication mechanisms available in the standard have not been formal...

2004
Masoud Sharif Babak Hassibi

It has been shown that with probability one the peak to mean envelope power ratio (PMEPR) of any random codeword chosen from a symmetric QAM/PSK constellation is logn where n is the number of subcarriers [l]. In this paper, the existence of codes with nonzero rate and PMEPR bounded by a constant is established.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید