The secret of the hydrogen bomb went from being an icon of nuclear secrecy to something that could be widely reproduced on the Internet and in children's textbooks. The rise and fall of the H-bomb secret reveals both changing attitudes towards state secrecy in general and the contingent nature of secrecy, depending on an imagined threat as guidance.

Safety and secrecy are formulated for a deterministic programming language. A safety property is deened as a set of program traces and secrecy is deened as a binary relation on traces, characterizing a form of Noninterference. Safety properties may have sound and complete execution monitors whereas secrecy has no such monitor.

This paper simplifies an existing coding scheme for the two-receiver discrete memoryless broadcast channel with complementary receiver side information where there is a passive eavesdropper and individual secrecy is required. The existing coding scheme is simplified in two steps by replacing Wyner’s secrecy coding with Carleial-Hellman’s secrecy coding as well as removing additional randomness ...

We study ballot independence for election schemes. First, we formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. Secondly, we introduce a notion of controlled malleability and prove that it is sufficient for ballot independence. We also prove that non-malleable ballots are sufficient for ballot independence. Thirdly, we prove th...

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional private messages for these two receivers, such that each receiver is only interested in one message, while being fully cognizant of the other one. First, this m...

We develop a systematic proof procedure for establishing secrecy results for cryptographic protocols. Part of the procedure is to reduce messages to simplified constituents, and its core is a search procedure for establishing secrecy results. This procedure is sound but incomplete in that it may fail to establish secrecy for some secure protocols. However, it is amenable to mechanization, and i...

We study ballot independence for election schemes: – We formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. – We introduce a notion of controlled malleability and show that it is sufficient for ballot independence. We also show that non-malleable ballots are sufficient, but not necessary, for ballot independence. – We prove that...

We show that the secrecy function conjecture that states that the maximum of the secrecy function of an l-modular lattice occurs at 1/ √ l is false, by proving that the 4-modular lattice C = Z⊕ √ 2Z⊕ 2Z fails to satisfy this conjecture. We also indicate how the secrecy function must be modified in the l-modular case to have a more reasonable chance for it to have a maximum at 1/ √ l, and show t...

A 2-wave survey study among 1173 10–14-year-olds tested the longitudinal contribution of secrecy from parents to psychosocial and behavioral problems in adolescence. Additionally, it investigated a hypothesized contribution of secrecy from parents to adolescent development by examining its relation with self-control. Results showed that keeping secrets from parents is associated with substantia...

In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite memory are very common in wireless communications as well as in wireline communications (e.g., in communications over power lines). To derive the secrecy ca...