Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
From MaRDI portal
Publication:2954373
DOI10.1137/130929643zbMath1362.94016OpenAlexW2090603603MaRDI QIDQ2954373
Benny Applebaum, Eyal Kushilevitz, Brent Waters, Yuval Ishai
Publication date: 13 January 2017
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1eb65e471b5aa9a896c10c4255f609f87cdf2c75
Related Items (3)
Storing and Retrieving Secrets on a Blockchain ⋮ Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing ⋮ Functional Encryption for Turing Machines
Cites Work
- On interactive proofs with a laconic prover
- On-line/off-line digital signatures
- Computationally private randomizing polynomials and their applications
- A minimal model for secure computation (extended abstract)
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- How to Run Turing Machines on Encrypted Data
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Functional Encryption: Definitions and Challenges
- Semi-homomorphic Encryption and Multiparty Computation
- Key-Dependent Message Security: Generic Amplification and Completeness
- Probabilistically Checkable Arguments
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Founding Cryptography on Tamper-Proof Hardware Tokens
- How to Encrypt with the LPN Problem
- Bounded Key-Dependent Message Security
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- One-Time Programs
- Founding Cryptography on Oblivious Transfer – Efficiently
- A method for obtaining digital signatures and public-key cryptosystems
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- On the Power of Correlated Randomness in Secure Computation
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- How to Garble RAM Programs?
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- How to Garble Arithmetic Circuits
- Reusable garbled circuits and succinct functional encryption
- Scalable Secure Multiparty Computation
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
