scientific article; zbMATH DE number 2090929

zbMath1045.68913MaRDI QIDQ4813519

George Danezis, Andrei Serjantov

Publication date: 13 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2482/24820041.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99)

Related Items

Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security, Probabilistic and nondeterministic aspects of anonymity, An information-theoretic model of voting systems, Probable innocence revisited, PAC privacy: automatic privacy measurement and control of data processing, Information theoretical cryptogenography, Efficient construction of provably secure steganography under ordinary covert channels, A universally composable framework for the privacy of email ecosystems, Analyzing anonymity attacks through noisy channels, Self-organized Anonymous Authentication in Mobile Ad Hoc Networks, On compositional reasoning about anonymity and privacy in epistemic logic, Conditional anonymity with non-probabilistic adversary, Anonymity protocols as noisy channels, Anonymity Protocols as Noisy Channels, A Framework for Automatically Checking Anonymity with μCRL, Evaluation of anonymity and confidentiality protocols using theorem proving, Compositional Methods for Information-Hiding, Formalization of Entropy Measures in HOL, A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database, A Formalization of Anonymity and Onion Routing