Search

This paper explores cosmopsychism's explanatory aspirations from a programmatic perspective. The bulk of the text consists of an argument in favor of the conclusion that cosmopsychism suffers from no insurmountable  individuation  problem (IND). I argue that the widespread tendency to view IND as a mirror-image of micropsychism's combination problem (CP) is mistaken. In particular, what renders CP insolvable, namely, the commitment to the  coupling  of phenomenal constitution with phenomenal inclusion, is, from the standpoint of cosmopsychism, an entirely nonmandatory assumption. I proceed to show that  severing  this unhappy coupling is the key for defending cosmopsychism against the charge of theoretical incoherence. Moreover, I argue that successful defense against such accusation could be mounted regardless of whether or not we assume cosmic consciousness to be perspectival in nature. In addition, the paper touches upon another foundational issue: cautioning against the popular tendency to identify cosmopsychism's  monism  with a mereological unity-in-diversity, and motivating an alternative conception which I call  generative  monism. Finally, as befitting this volume, I pause to reflect upon the question of which schools of Hindu philosophy might tally best, and connect most fruitfully, with cosmopsychism as I understand it. [ABSTRACT FROM AUTHOR]

Hedged public-key encryption (HPKE), introduced by Bellare et al. (ASIACRYPT 2009), provides useful security when the per-message randomness fails to be uniform due to faulty implementations or adversarial actions. The HPKE scheme achieves IND-CPA (chosen plaintext attack) security when the randomness they used is of high quality, but, when the randomness is poor quality, rather than breaking completely, it achieves a weaker but a useful notion of security called IND-CDA (chosen distribution attack) as long as the message and randomness together have sufficient min-entropy. However, little research on HPKE in the presence of key leakage was done. In this paper, we study HPKE featuring key leakage-resilience and formulate appropriate security notion for key leakage-resilient HPKE. We work in the continual key leakage model where the secret key is refreshed periodically and an adversary can learn arbitrary but bounded leakage on the secret key between the updates. We present two generic constructions of continual leakage-resilient HPKE in the standard model by using a continual leakage-resilient all-but-one lossy trapdoor function. Finally, we give an instantiation of leakage-resilient HPKE under the linear assumption in bilinear groups. [ABSTRACT FROM AUTHOR]