scientific article; zbMATH DE number 7561346
From MaRDI portal
Publication:5090982
DOI10.4230/LIPIcs.FSTTCS.2018.41MaRDI QIDQ5090982
Balthazar Bauer, Jevgēnijs Vihrovs, Hoeteck Wee
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.02396
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (2)
Predicate encryption from bilinear maps and one-sided probabilistic rank ⋮ Secure computation with preprocessing via function secret sharing
Cites Work
- Unnamed Item
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Towards breaking the exponential barrier for general secret sharing
- Conditional disclosure of secrets via non-linear reconstruction
- A minimal model for secure computation (extended abstract)
- Matching-Vector Families and LDCs over Large Modulo
- 2-Server PIR with Sub-Polynomial Communication
- Randomly Encoding Functions: A New Cryptographic Paradigm
- Matching Vector Codes
- Predicate Encryption for Circuits from LWE
- Towards 3-query locally decodable codes of subexponential length
- Conjunctive, Subset, and Range Queries on Encrypted Data
- 3-Query Locally Decodable Codes of Subexponential Length
- Probabilistic rank and matrix rigidity
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- New bounds for matching vector families
- Cryptography in $NC^0$
This page was built for publication:
