Cryptography and Data Security

By D. Denning. 1982

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Prochlo: Strong Privacy for Analytics in the Crowd (2017, methodology): “To illustrate, consider the app/API example from § 2.1 (see § 5 for detailed use cases).”
Maintaining Data Privacy in Association Rule Mining (2002, background): “Note that some of the other privacy techniques suggested in the literature, such as swapping values between records [7], do not support this feature since they require the entire database to be available for their functioning.”
Parallel Collision Search with Cryptanalytic Applications (2013, background): “100 of [11]) to reduce the search time in Hellman’s time-memory tradeoff [22].”
Data Dilemmas in the Information Society: Introduction and Overview (2013, unknown): “18 Denning, D.E. (1983). 19 Holsheimer, M.”
All-or-Nothing Disclosure of Secrets (1986, background): “Notice that this is crucial, because it is well-known in classical cryptography that the exclusive-or of two plaintext English messages allows easy recovery of them both, just as a running stream Vigene`re would [ D ].”
Mining Association Rules under Privacy Constraints (2008, background): “For example, the swapping of values between different customer records, as proposed in [17].”
Privacy integrated queries (2010, background): “Information Flow Control [ 11 ] tracks the flow of sensitive information through general computation.”
Intrusion detection using sequences of system calls (1998, unknown): “Other important non-IDS solutions to computer security problems are provided by cryptography [12], which is especially useful for authentication and secure communications [34].”
Controlling Access to Published Data Using Cryptography (2003, background): “Database security has been studied extensively in the past [13, 1, 9], however none of that work applies to data publishing.”
Order computations in generic groups (2007, methodology): “Rivest considers a more general model of “computational groups” in which an algorithm has access to the representation, but notes that the theory may also be applied to black-box groups.”