Asymptotically quasi-optimal cryptography
From MaRDI portal
Publication:2170004
DOI10.1007/978-3-031-06944-4_11zbMATH Open1496.94039OpenAlexW4285301190MaRDI QIDQ2170004FDOQ2170004
Vinod Vaikuntanathan, Leo de Castro, Muthu Venkitasubramaniam, Carmit Hazay, Yuval Ishai
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_11
Recommendations
- Cryptography with constant computational overhead
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Secure arithmetic computation with constant computational overhead
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Asynchronous Multi-Party Computation with Quadratic Communication
Cites Work
- Fully Homomorphic Encryption with Polylog Overhead
- On ideal lattices and learning with errors over rings
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Optimization, approximation, and complexity classes
- Short PCPs with Polylog Query Complexity
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Title not available (Why is that?)
- Efficient oblivious transfer protocols
- Title not available (Why is that?)
- Oblivious Transfer Is Symmetric
- Foundations of Cryptography
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- (Leveled) fully homomorphic encryption without bootstrapping
- A Framework for Efficient and Composable Oblivious Transfer
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Semi-homomorphic Encryption and Multiparty Computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Candidate One-Way Functions Based on Expander Graphs
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Cryptography with constant computational overhead
- Generalized Compact Knapsacks Are Collision Resistant
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Theory of Cryptography
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Short pairing-based non-interactive zero-knowledge arguments
- Extracting Correlations
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On the concrete efficiency of probabilistically-checkable proofs
- Circuits resilient to additive attacks with applications to secure computation
- Title not available (Why is that?)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Zero-knowledge proofs from secure multiparty computation
- A Toolkit for Ring-LWE Cryptography
- On linear-size pseudorandom generators and hardcore functions
- Amortized complexity of information-theoretically secure MPC revisited
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Title not available (Why is that?)
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Two-message statistically sender-private OT from LWE
- Exploring crypto dark matter: new simple PRF candidates and their applications
- A generic approach to constructing and proving verifiable random functions
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Interactive Oracle Proofs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Reusable non-interactive secure computation
- Secure computation with constant communication overhead using multiplication embeddings
- Trapdoor hash functions and their applications
- Sanitization of FHE Ciphertexts
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- Efficient pseudorandom correlation generators from ring-LPN
- Compressible FHE with applications to PIR
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Title not available (Why is that?)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Subquadratic SNARGs in the random oracle model
- FHE Circuit Privacy Almost for Free
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
- Constant-Rate Oblivious Transfer from Noisy Channels
Cited In (5)
- Oblivious transfer with constant computational overhead
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Sok: vector OLE-based zero-knowledge protocols
- An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
- Efficient Encryption From Random Quasi-Cyclic Codes
Uses Software
This page was built for publication: Asymptotically quasi-optimal cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170004)
