Laconic cryptography with preprocessing
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 2081076 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A new approach to practical active-secure two-party computation
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient circuit-based PSI with linear communication
- Efficient laconic cryptography from learning with errors
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient set operations in the presence of malicious adversaries
- Extractable witness encryption for KZG commitments and efficient laconic OT
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Information Security and Privacy
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Laconic function evaluation and applications
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Laconic oblivious transfer and its applications
- Laconic private set intersection and applications
- Linear-complexity private set intersection protocols secure in malicious model
- Lower-bounds on public-key operations in PIR
- Maliciously secure oblivious linear function evaluation with constant overhead
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious Polynomial Evaluation
- Oblivious transfer with constant computational overhead
- On lattices, learning with errors, random linear codes, and cryptography
- PSI from PaXoS: fast, malicious private set intersection
- Privacy-Preserving Set Operations
- Private information retrieval with sublinear online time
- Private set intersection in the internet setting from lightweight oblivious PRF
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Secure Arithmetic Computation with No Honest Majority
- Secure arithmetic computation with constant computational overhead
- Secure computation with preprocessing via function secret sharing
- Semi-homomorphic encryption and multiparty computation
- SpOT-light: lightweight private set intersection from sparse OT extension
- Two-round oblivious linear evaluation from learning with errors
This page was built for publication: Laconic cryptography with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232559)
