More Like this

1. A Reference Architecture of Human Cyber-Physical Systems – Part III: Semantic Foundations

   https://doi.org/10.1145/3622881  

   Damm, Werner; Fränzle, Martin; Kerscher, Alyssa J.; Laine, Forrest; Bengler, Klaus; Biebl, Bianca; Hagemann, Willem; Held, Moritz; Hess, David; Ihme, Klas; et al (January 2024, ACM Transactions on Cyber-Physical Systems)

   Chenyang Lu (Ed.)

   The design and analysis of multi-agent human cyber-physical systems in safety-critical or industry-critical domains calls for an adequate semantic foundation capable of exhaustively and rigorously describing all emergent effects in the joint dynamic behavior of the agents that are relevant to their safety and well-behavior. We present such a semantic foundation. This framework extends beyond previous approaches by extending the agent-local dynamic state beyond state components under direct control of the agent and belief about other agents (as previously suggested for understanding cooperative as well as rational behavior) to agent-local evidence and belief about the overall cooperative, competitive, or coopetitive game structure. We argue that this extension is necessary for rigorously analyzing systems of human cyber-physical systems because humans are known to employ cognitive replacement models of system dynamics that are both non-stationary and potentially incongruent. These replacement models induce visible and potentially harmful effects on their joint emergent behavior and the interaction with cyber-physical system components. 

   more » « less
2. Enabling or Limiting Cognitive Flexibility? Evidence of Demand for Moral Commitment

   Saccardo, Silvia Serra-Garcia (February 2023, American Economic Review)

   Moral behavior is more prevalent when individuals cannot easily distort their beliefs self-servingly. Do individuals seek to limit or enable their ability to distort beliefs? How do these choices affect behavior? Experiments with over 9,000 participants show prefer- ences are heterogeneous—30 percent of participants prefer to limit belief distortion, while over 40 percent prefer to enable it, even if costly. A random assignment mechanism reveals that being assigned to the preferred environment is necessary for curbing or enabling self-serving behavior. Third parties can anticipate these effects, sug- gesting some sophistication about the cognitive constraints to belief distortion. 

   more » « less
3. On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash

   https://doi.org/10.62056/AK2I5W7SF  

   Liang, Mingyu; Choi, Seung Geol; Dachman-Soled, Dana; Liu, Linsheng; Yerukhimovich, Arkady (January 2025, IACR Communications in Cryptology)

   The min-hash sketch is a well-known technique for low-communication approximation of the Jaccard index between two input sets. Moreover, there is a folklore belief that min-hash sketch-based protocols protect the privacy of the inputs. In this paper, we consider variants of private min-hash sketch based-protocols and investigate this folklore to quantify the privacy of the min-hash sketch. We begin our investigation by presenting a highly-efficient two-party protocol for estimating the Jaccard index while ensuring differential privacy. This protocol adds Laplacian noise to the min-hash sketch counts to provide privacy protection. Then, we aim to understand what privacy, if any, is guaranteed if the results of the min-hash are released without any additional noise, such as in the case of historical data. We begin our investigation by considering the privacy of min-hash in a centralized setting where the hash functions are chosen by the min-hash functionality and are unknown to the participants. We show that in this case the min-hash output satisfies the standard definition of differential privacy (DP) without any additional noise. We next consider a more practical distributed setting, where the hash function must be shared among all parties and is typically public. Unfortunately, we show that in this public hash function setting, the min-hash output is no longer DP. We therefore consider the notion of distributional differential privacy (DDP) introduced by Bassily et al. (FOCS 2013). We show that if the honest party's set has sufficiently high min-entropy, the min-hash output achieves DDP without requiring noise. Our findings provide guidance on how to use the min-hash sketch for private Jaccard index estimation and clarify the extent to which min-hash protocols protect input privacy, refining the common belief in their privacy guarantees. 

   more » « less
4. The secrecy capacity of cost-constrained wiretap channels,

   S. Sreekumar, A. Bunin (January 2021, IEEE transactions on information theory)

   null (Ed.)

   In many information-theoretic channel coding prob- lems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief, such a simple modification does not hold for the cost-constrained (CC) wiretap channel (WTC). The secrecy-capacity of the discrete memoryless (DM) WTC without cost constraints is described by a single auxiliary random variable. For the CC DM-WTC, however, we show that two auxiliaries are necessary to achieve capacity. Specifically, we first derive the secrecy-capacity formula, proving the direct part via superposition coding. Then, we provide an example of a CC DM-WTC whose secrecy-capacity cannot be achieved using a single auxiliary. This establishes the fundamental role of superposition coding over CC WTCs. 

   more » « less
5. The Secrecy Capacity of Cost-constrained Wiretap Channels

   https://doi.org/10.1109/TIT.2020.3039916  

   Sreekumar, Sreejith; Bunin, Alexander; Goldfeld, Ziv; Permuter, Haim (January 2022, IEEE transactions on information theory)

   In many information-theoretic channel coding problems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief, such a simple modification does not hold for the cost-constrained (CC) wiretap channel (WTC). The secrecy-capacity of the discrete memoryless (DM) WTC without cost constraints is described by a single auxiliary random variable. For the CC DM-WTC, however, we show that two auxiliaries are necessary to achieve capacity. Specifically, we first derive the secrecy-capacity formula, proving the direct part via superposition coding. Then, we provide an example of a CC DM-WTC whose secrecy-capacity cannot be achieved using a single auxiliary. This establishes the fundamental role of superposition coding over CC WTCs. 

   more » « less