TCC 2016 - PDF Preprint Papers

TCC 2016 Theory of Cryptography Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCC-2016 Paper

click to vote

TCC
2016
Springer

101views Cryptology» more TCC 2016»

Cryptographic Assumptions: A Position Paper

3 years 6 months ago

Download eprint.iacr.org

Shafi Goldwasser, Yael Tauman Kalai

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	101	Cryptographic Assumptions: A Position Paper	claim
2	77	On the Complexity of Additively Homomorphic UC Commitments	claim
3	64	Contention in Cryptoland: Obfuscation, Leakage and UCE	claim
4	64	Point-Function Obfuscation: A Framework and Generic Constructions	claim
5	61	Homomorphic Evaluation Requires Depth	claim
6	59	Indistinguishability Obfuscation: From Approximate to Exact	claim
7	56	A Study of Pair Encodings: Predicate Encryption in Prime Order Groups	claim
8	54	Multilinear Maps from Obfuscation	claim
9	54	Characterization of Secure Multiparty Computation Without Broadcast	claim
10	53	Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography	claim
11	52	From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back	claim
12	50	Rational Sumchecks	claim
13	50	Standard Security Does Imply Security Against Selective Opening for Markov Distributions	claim
14	49	On Constructing One-Way Permutations from Indistinguishability Obfuscation	claim
15	49	Functional Encryption for Turing Machines	claim
16	48	Lower Bounds on Assumptions Behind Indistinguishability Obfuscation	claim
17	47	Improved OR-Composition of Sigma-Protocols	claim
18	47	How to Avoid Obfuscation Using Witness PRFs	claim
19	47	On the Correlation Intractability of Obfuscated Pseudorandom Functions	claim
20	46	Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits	claim
21	46	Output-Compressing Randomized Encodings and Applications	claim
22	44	Information-Theoretic Local Non-malleable Codes and Their Applications	claim
23	44	Non-Malleable Encryption: Simpler, Shorter, Stronger	claim
24	43	Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings	claim
25	43	On Basing Private Information Retrieval on NP-Hardness	claim
26	43	Cutting-Edge Cryptography Through the Lens of Secret Sharing	claim
27	42	Interactive Coding for Interactive Proofs	claim
28	42	Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM	claim
29	41	On the Hardness of Learning with Rounding over Small Modulus	claim
30	41	Two-Round Man-in-the-Middle Security from LPN	claim
31	40	Oblivious Parallel RAM and Applications	claim
32	40	Functional Encryption Without Obfuscation	claim
33	39	Optimal Computational Split-state Non-malleable Codes	claim
34	38	Order-Revealing Encryption and the Hardness of Private Learning	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers