Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
Doctoral Theses
In symmetric key cryptography there are two fundamental objectives, viz. 1. confidentiality or secrecy of message from unexpected party and 2. authentication of message which includes authenticating the source of the message as well as integrity of the message against any unwanted modification. Let us first concentrate on confidentiality. In classical symmetric key cryptography two parties, say Alice and Bob, first secretly exchange a key-pair (e, d). Later, if Alice wishes to send a secret message m ∈ M to Bob, she computes c = Ee(m) and transmits c to Bob. Upon receiving c, Bob computes Dd(c) = m and …
On Tests Of Independence Among Multiplerandom Vectors Of Arbitrary Dimensions., Angshuman Roy Dr.
On Tests Of Independence Among Multiplerandom Vectors Of Arbitrary Dimensions., Angshuman Roy Dr.
Doctoral Theses
Measures of dependence among several random vectors and associated tests of independence play a major role in different statistical applications. Blind source separation or independent component analysis (see, e.g., Hyv¨arinen et al., 2001; Shen et al., 2009), feature selection and feature extraction (see, e.g., Li et al., 2012), detection of serial correlation in time series (see, e.g., Ghoudi et al., 2001) and finding the causal relationships among the variables (see, e.g., Chakraborty and Zhang, 2019) are some examples of their wide-spread applications. Tests of independence has vast applications in other areas of sciences as well. For instance, to characterize the …
Essays On Efficiency, Fairness And Strategy-Proofness In Allocation Problems With Exact Capacity Constraints., T. C. A. Madhav Raghavan Dr.
Essays On Efficiency, Fairness And Strategy-Proofness In Allocation Problems With Exact Capacity Constraints., T. C. A. Madhav Raghavan Dr.
Doctoral Theses
In this thesis we consider situations where heterogenous objects are to be distributed among a set of claimants. The objects in question are indivisible, so they cannot be split or shared. There is no money in this economy, so objects cannot be simply bought and sold. Allocations to claimants must be based on their preferences over objects alone. We impose the additional restriction that each object has an exact capacity constraint, such that each object is assigned either to a pre-specified (and fixed) number of agents, or it is not assigned at all. Further, we assume that the capacity constraint …