scholarly journals Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers

2008 ◽  
Vol DMTCS Proceedings vol. AI,... (Proceedings) ◽  
Author(s):  
Christopher Eagle ◽  
Zhicheng Gao ◽  
Mohamed Omar ◽  
Daniel Panario ◽  
Bruce Richmond
Keyword(s):  
Difference Scheme ◽  
Limiting Distribution ◽  
Broadcast Encryption ◽  
Discrete Algorithms ◽  
Encryption Schemes ◽  
International Audience ◽  
The Mean ◽  
Subset Difference

International audience We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes. Park and Blake in: Journal of Discrete Algorithms, vol. 4, 2006, pp. 215―238, give the mean number of encryptions for these schemes. We continue their analysis and show that the limiting distribution of the number of encryptions for these schemes is normal. This implies that the mean numbers of Park and Blake are good estimates for the number of necessary encryptions used by these schemes.

scholarly journals The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)

2012 ◽  
Vol DMTCS Proceedings vol. AQ,... (Proceedings) ◽  
Author(s):  
Patrick Bindjeme ◽  
james Allen fill
Keyword(s):  
Large Class ◽  
Continuous Time ◽  
Random Variable ◽  
Limiting Distribution ◽  
International Audience ◽  
The Mean

International audience In a continuous-time setting, Fill (2012) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by $\texttt{QuickSort}$, when centered by subtracting the mean and scaled by dividing by time, has a limiting distribution, but proved little about that limiting random variable $Y$—not even that it is nondegenerate. We establish the nondegeneracy of $Y$. The proof is perhaps surprisingly difficult.

scholarly journals The distribution of ascents of size $d$ or more in samples of geometric random variables

2005 ◽  
Vol DMTCS Proceedings vol. AD,... (Proceedings) ◽  
Author(s):  
Charlotte Brennan ◽  
Arnold Knopfmacher
Keyword(s):  
Nonnegative Integer ◽  
Random Variables ◽  
Limiting Distribution ◽  
Geometric Probability ◽  
International Audience ◽  
The Mean ◽  
Mean Variance

International audience We consider words or strings of characters $a_1a_2a_3 \ldots a_n$ of length $n$, where the letters $a_i \in \mathbb{Z}$ are independently generated with a geometric probability $\mathbb{P} \{ X=k \} = pq^{k-1}$ where $p+q=1$. Let $d$ be a fixed nonnegative integer. We say that we have an ascent of size $d$ or more if $a_{i+1} \geq a_i+d$. We determine the mean, variance and limiting distribution of the number of ascents of size $d$ or more in a random geometrically distributed word.

scholarly journals The distribution of ascents of size d or more in compositions

2009 ◽  
Vol Vol. 11 no. 1 (Combinatorics) ◽  
Author(s):  
Charlotte Brennan ◽  
Arnold Knopfmacher
Keyword(s):  
Positive Integer ◽  
Nonnegative Integer ◽  
Finite Sequence ◽  
Limiting Distribution ◽  
International Audience ◽  
The Mean ◽  
Average Size ◽  
Positive Integers ◽  
Mean Variance

Combinatorics International audience A composition of a positive integer n is a finite sequence of positive integers a(1), a(2), ..., a(k) such that a(1) + a(2) + ... + a(k) = n. Let d be a fixed nonnegative integer. We say that we have an ascent of size d or more if a(i+1) >= a(i) + d. We determine the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. We also study the average size of the greatest ascent over all compositions of n.

scholarly journals BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1389
Author(s):  
Jiwon Lee ◽  
Jihye Kim ◽  
Hyunok Oh
Keyword(s):  
The Other ◽  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
The Public ◽  
Private Key ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Encryption Decryption ◽  
Subset Difference

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

Broadcast encryption schemes based on RSA

2009 ◽  
Vol 16 (1) ◽  
pp. 69-75 ◽  
Author(s):  
Ning-bo MU ◽  
Yu-pu HU ◽  
Hai-wen OU
Keyword(s):  
Broadcast Encryption ◽  
Encryption Schemes

Public Key Broadcast Encryption Schemes With Shorter Transmissions

2008 ◽  
Vol 54 (3) ◽  
pp. 401-411 ◽  
Author(s):  
Jong Hwan Park ◽  
Hee Jean Kim ◽  
M.H. Sung ◽  
Dong Hoon Lee
Keyword(s):  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Schemes

The number of extreme points in the convex hull of a random sample

1991 ◽  
Vol 28 (02) ◽  
pp. 287-304 ◽  
Author(s):  
David J. Aldous ◽  
Bert Fristedt ◽  
Philip S. Griffin ◽  
William E. Pruitt
Keyword(s):  
Convex Hull ◽  
Random Sample ◽  
Limit Distribution ◽  
Extreme Points ◽  
Radial Component ◽  
Limiting Distribution ◽  
Precise Information ◽  
Mean And Variance ◽  
The Mean

Let {Xk} be an i.i.d. sequence taking values in ℝ2with the radial and spherical components independent and the radial component having a distribution with slowly varying tail. The number of extreme points in the convex hull of {X1, · ··,Xn} is shown to have a limiting distribution which is obtained explicitly. Precise information about the mean and variance of the limit distribution is obtained.

scholarly journals Complete tree subset difference broadcast encryption scheme and its analysis

2012 ◽  
Vol 66 (1-3) ◽  
pp. 335-362 ◽  
Author(s):  
Sanjay Bhattacherjee ◽  
Palash Sarkar
Keyword(s):  
Broadcast Encryption ◽  
Encryption Scheme ◽  
Its Analysis ◽  
Complete Tree ◽  
Subset Difference
Sign in / Sign up

Export Citation Format

Share Document