Statistical Randomized Encodings: A Complexity Theoretic View
From MaRDI portal
Publication:3448769
DOI10.1007/978-3-662-47672-7_1zbMath1440.68073OpenAlexW951444452MaRDI QIDQ3448769
Shweta Agrawal, Yuval Ishai, Dakshita Khurana, Anat Paskin-Cherniavsky
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.901.3005
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (4)
On the Power of Statistical Zero Knowledge ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ On the power of secure two-party computation ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
Cites Work
- Unnamed Item
- Cryptography in constant parallel time
- Relativized perfect zero knowledge is not BPP
- Computationally private randomizing polynomials and their applications
- A minimal model for secure computation (extended abstract)
- From randomizing polynomials to parallel algorithms
- Randomly Encoding Functions: A New Cryptographic Paradigm
- Number-theoretic constructions of efficient pseudo-random functions
- A complete problem for statistical zero knowledge
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Easy Decision Diffie-Hellman Groups
- Cryptography in $NC^0$
This page was built for publication: Statistical Randomized Encodings: A Complexity Theoretic View
