scientific article
From MaRDI portal
Publication:2754171
zbMath0973.94545MaRDI QIDQ2754171
Joy Müller, Christian Cachin, Joe Kilian, Jan Camenisch
Publication date: 9 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Black-box reusable NISC with random oracles ⋮ Efficient and scalable universal circuits ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Homomorphic secret sharing for low degree polynomials ⋮ A Practical Universal Circuit Construction and Secure Evaluation of Private Functions ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings
