Asymptotically quasi-optimal cryptography
From MaRDI portal
Publication:2170004
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
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 708807 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Framework for Efficient and Composable Oblivious Transfer
- A generic approach to constructing and proving verifiable random functions
- A non-PCP approach to succinct quantum-safe zero-knowledge
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A toolkit for ring-LWE cryptography
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Amortized complexity of information-theoretically secure MPC revisited
- Aurora: transparent succinct arguments for R1CS
- Candidate one-way functions based on expander graphs
- Circuits resilient to additive attacks with applications to secure computation
- Compressible FHE with applications to PIR
- Constant-rate oblivious transfer from noisy channels
- Cryptography with constant computational overhead
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient oblivious transfer protocols
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient secure two-party computation using symmetric cut-and-choose
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Extracting correlations
- FHE circuit privacy almost for free
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Generalized Compact Knapsacks Are Collision Resistant
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Interactive oracle proofs
- Lapin: an efficient authentication protocol based on ring-LPN
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Low-complexity cryptographic hash functions
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Oblivious Transfer Is Symmetric
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On linear-size pseudorandom generators and hardcore functions
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- On the concrete efficiency of probabilistically-checkable proofs
- Optimization, approximation, and complexity classes
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Probabilistically checkable proofs of proximity with zero-knowledge
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Reusable non-interactive secure computation
- Sanitization of FHE ciphertexts
- Scalable zero knowledge with no trusted setup
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Secure computation with constant communication overhead using multiplication embeddings
- Semi-homomorphic encryption and multiparty computation
- Short PCPs with Polylog Query Complexity
- Short pairing-based non-interactive zero-knowledge arguments
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Subquadratic SNARGs in the random oracle model
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- Succinct non-interactive arguments via linear interactive proofs
- Theory of Cryptography
- Trapdoor hash functions and their applications
- Two-message statistically sender-private OT from LWE
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-knowledge proofs from secure multiparty computation
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(6)- Efficient Encryption From Random Quasi-Cyclic Codes
- 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
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
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)
