Stealth Publications
As most members of the Stealth team have a doctorate in Computer Science or a related field, as well as work experience in researching and developing solutions related to cryptography and cybersecurity, we have an extensive collection of publications in peer-reviewed conferences and journals. While our company’s passion is in developing privacy-enhancing technologies and solutions for real-world problems, we draw upon our deep understanding of cryptography theory to help inspire the design, efficient implementation, and rigorous security features that distinguish our software tools.
We list below publications by Stealth team members that are relevant to the work we do and the software solutions that we develop. Papers that are a result of direct work on one of our funded projects are tagged with the program name in brackets.
Jump to Decade (or switch to Publications By Category):
2020-Current
2023
2022
Succinct Non-Interactive Arguments via Linear Interactive Proofs
PSI from Ring-OLE
[WIZKIT] On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives
[WIZKIT] The Hardness of LPN over Any Integer Ring and Field for PCG Applications
[WIZKIT] Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One
Universally Composable Almost-Everywhere Secure Computation
[WIZKIT] Authenticated Garbling from Simple Correlations
A Linear-Time 2-Party Secure Merge Protocol
[WIZKIT] ZK-PCPs from Leakage-Resilient Secret Sharing
[WIZKIT] Orion: Zero Knowledge Proof with Linear Prover Time
[WIZKIT] Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached RAM for ANSI C Programs
[WIZKIT] Triply Adaptive UC NIZK
[WIZKIT] Light Commands: Laser-Based Audio Injection Attacks on Voice-Controllable Systems
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker
[WIZKIT] AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication
[WIZKIT] Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers
[WIZKIT] EpiGRAM: Practical Garbled RAM*
(*Won Best Paper award at EUROCRYPT ’22)
[WIZKIT] Garbled Circuits with Sublinear Evaluator
Round-Optimal and Communication-Efficient Multiparty Computation
Adaptively Secure Computation for RAM Programs
CNF-FSS and Its Applications
3-Party Distributed ORAM from Oblivious Set Membership
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares
Streaming and Unbalanced PSI from Function Secret Sharing
A Linear-Time 2-Party Secure Merge Protocol
[ANISE] Secure Merge in Linear Time and O(log log N) Rounds
[CARMA] Anonymous Permutation Routing
Spook.js: Attacking Chrome Strict Site Isolation via Speculative Execution
[WIZKIT] EZEE: Epoch Parallel Zero Knowledge for ANSI C
[WIZKIT] Proving UNSAT in Zero Knowledge
[WIZKIT] Lend Me Your Ear: Passive Remote Physical Side Channels on PCs
[WIZKIT] Polynomial Commitment with a One-to-Many Prover and Applications
[WIZKIT] Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs
[WIZKIT] Half-Tree: Halving the Cost of Tree Expansion in COT and DPF
[WIZKIT] Solo: A Lightweight Static Analysis for Differential Privacy
2021
[PULSAR] Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
How to Build a Trapdoor Function from an Encryption Scheme
[WIZKIT] Constant-Overhead Zero-Knowledge for RAM Programs
ACCO: Algebraic Computation with Comparison
[WIZKIT] Line-Point Zero Knowledge and Its Applications
Secure Merge with O(n log log n) Secure Operations
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting
Threshold Garbled Circuits and Ad Hoc Secure Computation
Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds
[WIZKIT] PrORAM – Fast P(logn) Authenticated Shares ZK ORAM
[WIZKIT] Zero Knowledge Proofs for Decision Tree Predictions and Accuracy
[WIZKIT] Zero Knowledge Static Program Analysis
[WIZKIT] Nonce@Once: A Single-Trace EM Side Channel Attack on Several Constant-Time Elliptic Curve Implementations in Mobile Platforms
[WIZKIT] Prime+Probe 1, JavaScript 0: Overcoming Browser-based Side-Channel Defenses
[WIZKIT] CacheOut: Leaking Data on Intel CPUs via Cache Evictions
[WIZKIT] ZKCPlus: Optimized Fair-exchange Protocol Supporting Practical and Flexible Data Exchange
[WIZKIT] Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
[WIZKIT] QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field
[WIZKIT] Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning
[WIZKIT] Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time
[WIZKIT] Garbling, Stacked and Staggered – Faster k-out-of-n Garbled Function Evaluation
[WIZKIT] zkCNN: Zero Knowledge Proofs for Convolutional Neural Network Predictions and Accuracy
[WIZKIT] Efficient Generic Arithmetic for KKW – Practical Linear MPC-in-the-Head NIZK on Commodity Hardware Without Trusted Setup
[WIZKIT] Practical Garbled RAM: GRAM with O(log2 n) Overhead
2020
[PANTHEON] Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
Oblivious Sampling with Applications to Two-Party k-Means Clustering
[PULSAR] Batch Verification for Statistical Zero Knowledge Proofs
Efficient Error-Correcting Codes for Sliding Windows
[PANTHEON] Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)
On Succinct Arguments and Witness Encryption from Groups
[PULSAR] Master-Key KDM-Secure IBE from Pairings
[PANTHEON] Stacked Garbling – Garbled Circuit Proportional to Longest Execution Path
[PULSAR] Nearly Optimal Robust Secret Sharing against Rushing Adversaries
[PANTHEON] Stacked Garbling for Disjunctive Zero-Knowledge Proofs
[PULSAR,PANTHEON] Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era
Proof-of-Reputation Blockchain with Nakamoto Fallback
[PULSAR] Two-Round Oblivious Transfer from CDH or LPN
[PANTHEON] How Private Are Commonly-Used Voting Rules?
[PANTHEON] Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups
[PULSAR] Efficient 3-Party Distributed ORAM
[PANTHEON] Guaranteed Output Delivery Comes Free in Honest Majority MPC
[PULSAR] On the Round Complexity of OT Extension
[WIZKIT] Ligero++: A New Optimized Sublinear IOP
[PANTHEON] Broadcast-Optimal Two-Round MPC
[WIZKIT] Ferret: Fast Extension for Correlated OT with Small Communication
[PULSAR,PANTHEON] Oblivious Tight Compaction In O(n) Time with Smaller Constant
[PULSAR] Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
[PULSAR,PANTHEON] Round Optimal Secure Multiparty Computation from Minimal Assumptions
[PANTHEON] Malicious Security Comes Free in Honest-Majority MPC
Separating Two-Round Secure Computation From Oblivious Transfer
[PANTHEON] A Language for Probabilistically Oblivious Computation
[PULSAR] Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing
[PANTHEON] Types and Abstract Interpretation for Authorization Hook Advice
[PULSAR] Cryptography from Information Loss
[PANTHEON] DuetSGX: Differential Privacy with Secure Hardware
[PULSAR] Efficient Leakage Resilient Secret Sharing
[PANTHEON] Abstracting Faceted Execution
[PULSAR] Transitioning from testbeds to ships: an experience study in deploying the TIPPERS Internet of Things platform to the US Navy
2010-2019
2019
[PANTHEON] Scalable Private Set Union from Symmetric-Key Techniques
[PANTHEON] UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens
[PULSAR] The Broadcast Message Complexity of Secure Multiparty Computation
Trapdoor Hash Functions and Their Applications
[PULSAR] Universally Composable Secure Computation with Corrupted Tokens
[PULSAR] Reusable Non-Interactive Secure Computation
[PULSAR] Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
Cryptographic Sensing
[PULSAR] Rate-1 Trapdoor Functions from the Diffie-Hellman Problem
[PULSAR] Revisiting Non-Malleable Secret Sharing
[PULSAR] Private Anonymous Data Access
[PULSAR] New Techniques for Efficient Trapdoor Functions and Applications
[PANTHEON] Private Set Intersection with Linear Communication from General Assumptions
[DURASIFT] DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls
[PULSAR,PANTHEON] PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography
[PULSAR] Four-Round Secure Multiparty Computation from General Assumptions
On Round Optimal Secure Multiparty Computation from Minimal Assumptions
[PANTHEON] Duet: An Expressive Higher-Order Language and Linear Type System for Statically Enforcing Differential Privacy
Computing Statistics from Private Data
2018
Efficient robust secret sharing from expander graphs
Computing Statistics from Private Data
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
[PULSAR] Non-interactive Secure Computation from One-Way Functions
[PULSAR] Limits on the Power of Garbling Techniques for Public-Key Encryption
Registration-Based Encryption from Standard Assumptions
[PULSAR] Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
[PULSAR] Registration-Based Encryption: Removing Private-Key Generator from IBE
Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation
ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices
Cryptographically Secure Detection of Injection Attacks
[PULSAR] Adaptive Garbled RAM from Laconic Oblivious Transfer
[PULSAR] Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
On the Message Complexity of Secure Multiparty Computation
Population Stability: Regulating Size in the Presence of an Adversary
[PULSAR] Proactive Secure Multiparty Computation with a Dishonest Majority
[PULSAR] Round Optimal Black-Box “Commit-and-Prove”
[PULSAR] Information-Theoretic Broadcast with Dishonest Majority for Long Messages
2017
[PULSAR] Privacy Technologies for Controlled Information Sharing in Coalition Operations*
(*Won Best Paper award at KSCO ’17)
Special Issue: Algorithmic Tools in Cryptography
Coding for Interactive Communication Correcting Insertions and Deletions
Black-Box Parallel Garbled RAM
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
The Price of Low Communication in Secure Multi-party Computation
[PULSAR] Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
Circuit-Private Multi-key FHE
Laconic Oblivious Transfer and Its Applications
Brief Announcement: Secure Self-Stabilizing Computation
[PULSAR] Trapdoor Functions from the Computational Diffie-Hellman Assumption
Space-Time Tradeoffs for Distributed Verification
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Efficient, Reusable Fuzzy Extractors from LWE
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
[PULSAR] Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model
2016
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
Adaptively Secure Garbled Circuits from One-Way Functions
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
[SDB] Private Large-Scale Databases with Distributed Searchable Symmetric Encryption
Unconditionally Secure Computation with Reduced Interaction
Efficient Concurrent Covert Computation of String Equality and Set Intersection
Provably Secure Virus Detection: Using The Observer Effect Against Malware
Brief Announcement: Space-Time Tradeoffs for Distributed Verification
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority
Variability in Data Streams
High-Precision Secure Computation of Satellite Collision Probabilities
Proactive Secret Sharing with a Dishonest Majority
Adaptive Security with Quasi-Optimal Rate
On Round-Efficient Non-Malleable Protocols
2015
Local correctability of expander codes
Almost-Everywhere Secure Computation with Edge Corruptions
Optimal Coding for Streaming Authentication and Interactive Communication
Communication-Optimal Proactive Secret Sharing for Dynamic Groups
Impossibility of Black-Box Simulation Against Leakage Attacks
Cryptography with One-Way Communication
Round-Optimal Black-Box Two-Party Computation
Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World
Black-Box Garbled RAM
Locally Decodable Codes for Edit Distance
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults
Fast Distributed Almost Stable Matchings
Garbled RAM From One-Way Functions
Resettably Sound Zero-Knowledge Arguments from OWFs – The (Semi) Black-Box Way
Non-committing Encryption from Φ-hiding
Secure Multi-Party Computation with Identifiable Abort
2014
Privacy preserving protocol for detecting genetic relatives using rare variants
Privacy amplification with asymptotically optimal entropy loss
Cryptography in the Multi-string Model
Authenticated Adversarial Routing
Position-Based Quantum Cryptography: Impossibility and Constructions
Position-Based Cryptography
On linear-size pseudorandom generators and hardcore functions
Secure Message Transmission With Small Public Discussion
Deterministic and Energy-Optimal Wireless Synchronization
Maliciously Circuit-Private FHE
Garbled RAM Revisited
On Input Indistinguishable Proof Systems
Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
Cross-Domain Secure Computation
How to withstand mobile virus attacks, revisited
Fast and unconditionally secure anonymous channel
Communication-Efficient MPC for General Adversary Structures
On Selective-Opening Attacks against Encryption Schemes
Efficient Error-Correcting Codes for Sliding Windows
Black-box non-black-box zero knowledge
Statistical Concurrent Non-malleable Zero Knowledge
4-Round Resettably-Sound Zero Knowledge
Locally Updatable and Locally Decodable Codes
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality
Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation
2013
5PM: Secure pattern matching
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model
Building Lossy Trapdoor Functions from Lossy Encryption
On Linear-Size Pseudorandom Generators and Hardcore Functions
Optimal Coding for Streaming Authentication and Interactive Communication
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
How to Garble RAM Programs
Simultaneous Resettability from One-Way Functions
Local Correctability of Expander Codes
Robust Pseudorandom Generators
Broadcast (and Round) Efficient Verifiable Secret Sharing
Cryptography Using Captcha Puzzles
Concurrent Zero Knowledge in the Bounded Player Model
Succinct Non-interactive Arguments via Linear Interactive Proofs
[SDB] Distributed Oblivious RAM for Secure Two-Party Computation
Revisiting Lower and Upper Bounds for Selective Decommitments
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary
2012
New Techniques for Noninteractive Zero-Knowledge
Near-optimal radio use for wireless network synchronization
Impossibility Results for Static Input Secure Computation
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Unconditionally-Secure Robust Secret Sharing with Compact Shares
Constructing Non-malleable Commitments: A Black-Box Approach
Nearly Simultaneously Resettable Black-Box Zero Knowledge
Edge Fault Tolerance on Sparse Networks
Multiparty Proximity Testing with Dishonest Majority from Equality Testing
On Homomorphic Encryption and Chosen-Ciphertext Security
Correlated Product Security from Any One-Way Function
Extended-DDH and Lossy Trapdoor Functions
On the (in)security of hash-based oblivious RAM and a new balancing scheme
Identifying Cheaters without an Honest Majority
Resettable Statistical Zero Knowledge
Simultaneously Resettable Arguments of Knowledge
Simultaneous Resettability from Collision Resistance
Broadcast-Efficient Secure Multiparty Computation
2011
Visual cryptography on graphs
Searchable symmetric encryption: Improved definitions and efficient constructions
Public Key Locally Decodable Codes with Short Keys
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
Secure Message Transmission by Public Discussion: A Brief Survey
Constant-Rate Oblivious Transfer from Noisy Channels
Efficient Non-interactive Secure Computation
Deterministic and Energy-Optimal Wireless Synchronization
Multi-Server Oblivious RAM
2010
Password-Authenticated Session-Key Generation on the Internet in the Plain Model
Equivalence of Uniform Key Agreement and Composition Insecurity
Secure Message Transmission with Small Public Discussion
Asynchronous Throughput-Optimal Routing in Malicious Networks
Improved Fault Tolerance and Secure Computation on Sparse Networks
Public-Key Encryption with Efficient Amortized Updates
On Complete Primitives for Fairness
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security
2000-2009
2009
Efficient and secure authenticated key exchange using weak passwords
Zero-Knowledge Proofs from Secure Multiparty Computation
Attribute-Based Encryption
Error-correcting codes for automatic control
Position Based Cryptography
Extracting Correlations
2008
Black-box accountable authority identity-based encryption
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Improved algorithms for optimal embeddings
Circular-Secure Encryption from Decision Diffie-Hellman
Public-Key Locally-Decodable Codes
Communication Complexity in Algebraic Two-Party Protocols
Almost-Everywhere Secure Computation
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Cryptography with constant computational overhead
Visual Cryptography on Graphs
2007
Private Searching on Streaming Data
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
Attribute-based encryption with non-monotonic access structures
Secure two-party k-means clustering
Efficient Arguments without Short PCPs
Public Key Encryption That Allows PIR Queries
Covert Multi-Party Computation
Round Complexity of Authenticated Broadcast with a Dishonest Majority
Private Locally Decodable Codes
A Survey of Single-Database Private Information Retrieval: Techniques and Applications
Zero-knowledge from secure multiparty computation
Algebraic Lower Bounds for Computing on Encrypted Data
A Non-interactive Shuffle with Pairing Based Verifiability
Verifiable Shuffle of Large Size Ciphertexts
2006
Searchable symmetric encryption: improved definitions and efficient constructions
Non-interactive Zaps and New Techniques for NIZK
Perfect Non-interactive Zero Knowledge for NP
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
Cryptography from Anonymity
2005
Minimal Complete Primitives for Secure Multi-Party Computation
Private Searching on Streaming Data
Secure Remote Authentication Using Biometric Data
Error-Correcting Codes for Automatic Control
Sufficient Conditions for Collision-Resistant Hashing
Abstracts Collection — Anonymous Communication and its Applications
2004
Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds
Round-Optimal Secure Two-Party Computation
Public Key Encryption with Keyword Search
Efficient Consistency Proofs for Generalized Queries on a Committed Database
Identity-Based Zero Knowledge
Batch codes and their applications
2003
Amortizing Randomness in Private Multiparty Computations
Round Efficiency of Multi-party Computation with a Dishonest Majority
Dynamic routing on networks with fixed-size buffers
2002
Self-Stabilizing Symmetry Breaking in Constant Space
Forward Secrecy in Password-Only Key Exchange Protocols
Universally composable two-party and multi-party secure computation
2001
Universal Service-Providers for Private Information Retrieval
Robust Non-interactive Zero Knowledge
Efficient and Non-interactive Non-malleable Commitment
Cryptographic Counters and Applications to Electronic Voting
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Stability preserving transformations: packet routing networks with edge capacities and speeds
2000
The Las-Vegas Processor Identity Problem (How and When to Be Unique)
Adaptive Packet Routing for Bursty Adversarial Traffic
Randomness versus Fault-Tolerance
Reducibility and Completeness in Private Computations
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Xor-trees for efficient anonymous multicast and reception
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
Single Database Private Information Retrieval Implies Oblivious Transfer
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP
1990-1999
1999
The Linear-Array Conjecture in Communication Complexity Is False
Characterizing Linear Size Circuits in Terms of Privacy
On Concurrent Zero-Knowledge with Pre-processing
Conditional Oblivious Transfer and Timed-Release Encryption
Optimal and Efficient Clock Synchronization Under Drifting Clocks
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract)
1998
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
Computational Complexity and Knowledge Complexity
Log-Space Polynomial End-to-End Communication
Fast Digital Identity Revocation (Extended Abstract)
Micropayments via Efficient Coin-Flipping
Amortizing Randomness in Private Multiparty Computations
Universal Service-Providers for Database Private Information Retrieval (Extended Abstract)
Non-Interactive and Non-Malleable Commitment
1997
Deniable Encryption
Security of Blind Digital Signatures (Extended Abstract)
Efficient Anonymous Multicast and Reception (Extended Abstract)
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
Private Information Storage (Extended Abstract)
Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms
1996
Software Protection and Simulation on Oblivious RAMs
Self-Stabilizing Algorithms for Synchronous Unidirectional Rings
1995
1994
Reducibility and Completeness in Multi-Party Private Computations
Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract)
Simple and efficient leader election in the full information model
Computational complexity and knowledge complexity (extended abstract)
1993
Interactive Hashing Simplifies Zero-Knowledge Protocol Design
One-Way Functions are Essential for Non-Trivial Zero-Knowledge
1992
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
Secure Commitment Against A Powerful Adversary
1991
A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
How to Withstand Mobile Virus Attacks (Extended Abstract)
1990