Some open problems in information-theoretic cryptography
DOI10.4230/LIPICS.FSTTCS.2017.5zbMATH Open1493.94044OpenAlexW2788750140MaRDI QIDQ5136294FDOQ5136294
Authors: Vinod Vaikuntanathan 
Publication date: 25 November 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.5
Recommendations
cryptographyinformation-theoretic securitysecret sharingprivate information retrievalmultiparty computation
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Theory of Cryptography
- Quantum cryptography: public key distribution and coin tossing
- How to share a secret
- Title not available (Why is that?)
- The size of a share must be large
- Secret-Sharing Schemes: A Survey
- On the Cryptographic Complexity of the Worst Functions
- Protecting data privacy in private information retrieval schemes
- A minimal model for secure computation (extended abstract)
- The Wire-Tap Channel
- On the efficiency of local decoding procedures for error-correcting codes
- Simultaneous messages vs. communication
- Private information retrieval
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Automata, Languages and Programming
- On the Communication Complexity of Secure Computation
- Information Security
- Title not available (Why is that?)
- Communication and Randomness Lower Bounds for Secure Computation
- Automata, Languages and Programming
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- 2-Server PIR with Sub-Polynomial Communication
Cited In (7)
- On actively-secure elementary MPC reductions
- Private simultaneous messages based on quadratic residues
- Explicit lower bounds for communication complexity of PSM for concrete functions
- Information-theoretic Cryptography
- Information theoretical cryptogenography
- Title not available (Why is that?)
- Introduction to the Special Issue on Information Theoretic Security
This page was built for publication: Some open problems in information-theoretic cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136294)
