Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
146 | Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan |
Robust pcps of proximity, shorter pcps and applications to coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 1-10, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, PCP, locally decodable codes, locally testable codes |
102 | Jorik Blaas, Charl P. Botha, Frits H. Post |
Extensions of Parallel Coordinates for Interactive Exploration of Large Multi-Timepoint Data Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 14(6), pp. 1436-1451, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
102 | Yael Tauman Kalai, Ran Raz |
Interactive PCP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, pp. 536-547, 2008, Springer, 978-3-540-70582-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
90 | Oded Goldreich 0001, Madhu Sudan 0001 |
Locally testable codes and PCPs of almost-linear length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(4), pp. 558-655, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, derandomization, probabilistically checkable proofs, Proof verification |
90 | Eli Ben-Sasson, Madhu Sudan 0001 |
Simple PCPs with poly-log rate and query complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 266-275, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
PCPP, probabilistically checkable proofs, PCP, locally testable codes |
90 | Venkatesan Guruswami, Daniel Lewin 0001, Madhu Sudan 0001, Luca Trevisan |
A Tight Characterization of NP with 3 Query PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 8-17, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Probabilistically Checkable Proofs (PCP), Proof composition, Two-prover one-round proof systems, Adaptive and non-adaptive verifiers, Completeness and soundness, Complexity Theory, Query complexity |
73 | Oded Goldreich 0001, Madhu Sudan 0001 |
Locally Testable Codes and PCPs of Almost-Linear Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 13-22, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
68 | Venkatesan Guruswami |
On 2-Query Codeword Testing with Near-Perfect Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 267-276, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
66 | Lance Fortnow, Rahul Santhanam |
Infeasibility of instance compression and succinct PCPs for NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 133-142, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
instance compression, succinct PCPs, cryptography, parameterized complexity, polynomial hierarchy |
56 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
New direct-product testers and 2-query PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 131-140, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
testing, PCP, parallel repetition, direct products |
56 | Lars Engebretsen, Jonas Holmerin |
Three-Query PCPs with Perfect Completeness over non-Boolean Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 284-299, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Irit Dinur |
The PCP theorem by gap amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(3), pp. 12, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gap amplification, PCP |
51 | Dana Moshkovitz, Ran Raz |
Sub-constant error low degree test of almost-linear size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 21-30, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing |
51 | Jen-Shun Yang, Chien-Chao Tseng, Ray-Guang Cheng |
A Signal-to-Interference Ratio Based Downlink Scheduling Scheme for WCDMA Mobile Communication System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 19th International Conference on Advanced Information Networking and Applications (AINA 2005), 28-30 March 2005, Taipei, Taiwan, pp. 570-575, 2005, IEEE Computer Society, 0-7695-2249-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Johan Håstad |
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 235, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
49 | Sanjeev Arora |
Reductions, Codes, PCPs, and Inapproximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 404-413, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
NP-hard functions, code-like Levin reduction, complexity assumption, positive fraction, 3-colorable graph, code-like reduction, computational complexity, graph theory, error correction codes, error-correcting codes, NP-hardness, codes, inapproximability, PCPs, hardness, approximation ratio |
49 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs and Non-Approximability - Towards Tight Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 422-431, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability |
44 | Irit Dinur, Prahladh Harsha |
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 42(6), pp. 2452-2486, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
44 | Irit Dinur, Prahladh Harsha |
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Property Testing ![In: Property Testing - Current Research and Surveys, pp. 280-288, 2010, Springer, 978-3-642-16366-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
44 | Irit Dinur, Prahladh Harsha |
Composition of low-error 2-query PCPs using decodable PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
44 | Irit Dinur, Prahladh Harsha |
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 472-481, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
locally decodable, low soundness error, composition, PCP |
44 | Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 36(4), pp. 889-974, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR04, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
39 | Irit Dinur |
PCPs with small soundness error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 39(3), pp. 41-57, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan |
Short PCPs Verifiable in Polylogarithmic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 120-134, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 612-621, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing |
39 | Prahladh Harsha, Madhu Sudan 0001 |
Small PCPs with Low Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 327-338, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Li Yan, Sunwoo Park, Shahab Sheikh-Bahaei, Glen E. P. Ropella, C. Anthony Hunt |
Predicting hepatic disposition properties of cationic drugs using a physiologically based, agent-oriented In Silico Liver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim ![In: Proceedings of the 2008 Spring Simulation Multiconference, SpringSim 2008, Ottawa, Canada, April 14-17, 2008, pp. 162-169, 2008, SCS/ACM, 1-56555-319-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
drug disposition, hepatic, mechanistic, physiologically-based, prediction, systems biology, agent oriented |
34 | Subhash Khot |
On the power of unique 2-prover 1-round games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 767-775, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Subhash Khot |
On the Power of Unique 2-Prover 1-Round Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 25, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
2-prover games, Hardness of approximation, probabilistically checkable proofs |
34 | Ian Agol, Joel Hass, William P. Thurston |
3-MANIFOLD KNOT GENUS is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 24, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
2-prover games, Hardness of approximation, probabilistically checkable proofs |
34 | Joe Kilian |
Improved Efficient Arguments (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings, pp. 311-324, 1995, Springer, 3-540-60221-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
27 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu 0002 |
Agnostic Learning of Monomials by Halfspaces Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 385-394, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hardness of Learning, Dictatorship Tests, PCPs, Agnostic Learning |
27 | Or Meir |
Combinatorial construction of locally testable codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 285-294, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
pcps of proximity, probabilistically checkable proofs, locally testable codes |
27 | Offer Shai, Daniel Rubin |
Representing and analysing integrated engineering systems through combinatorial representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 19(4), pp. 221-232, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Abbreviations CR Combinatorial Representations, FCFS Flow Controlled Flow Source, FCPS Flow Controlled Potential difference Source, FGR Flow Graph Representation, MCA Multidisciplinary Combinatorial Approach, PCFS Potential difference Controlled Flow Source, PCPS Potential difference Controlled Potential difference Source, PGR Potential Graph Representation, RGR Resistance Graph Representation |
27 | Jonas Holmerin, Subhash Khot |
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 11-20, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
max-bisection, hardness of approximation, linear equations, PCPs |
22 | Dor Minzer, Kai Zhe Zheng |
Near Optimal Alphabet-Soundness Tradeoff PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-027, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
22 | Tom Gur, Jack O'Connor, Nicholas Spooner |
Perfect Zero-Knowledge PCPs for #P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.11941, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Harry Buhrman, Jonas Helsen, Jordi Weggemans |
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.04841, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Tom Gur, Jack O'Connor, Nicholas Spooner |
Perfect Zero-Knowledge PCPs for #P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2024, pp. 462, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
22 | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
Rigid Matrices from Rectangular PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 53(2), pp. 480-523, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Alessandro Chiesa, Ziyi Guan, Burcu Yildiz |
On Parallel Repetition of PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, pp. 34:1-34:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-309-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Dani Kiyasseh, Tingting Zhu 0001, David A. Clifton |
PCPs: Patient Cardiac Prototypes to Probe AI-based Medical Diagnoses, Distill Datasets, and Retrieve Patients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Mach. Learn. Res. ![In: Trans. Mach. Learn. Res. 2023, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
22 | Susumu Kiyoshima |
No-Signaling Linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 36(2), pp. 9, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Alessandro Chiesa, Ziyi Guan, Burcu Yildiz |
On Parallel Repetition of PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 1714, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
22 | Shuichi Hirahara, Dana Moshkovitz |
Regularization of Low Error PCPs and an Application to MCSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 39:1-39:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Joshua Cook, Dana Moshkovitz |
Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 55:1-55:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss |
ZK-PCPs from Leakage-Resilient Secret Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 35(4), pp. 23, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Joshua Cook, Dana Moshkovitz |
Tighter MA/1 Circuit Lower Bounds From Verifier Efficient PCPs for PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Mor Weiss |
Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 24(7), pp. 970, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Mor Weiss |
Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1524, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Liron Bronfman, Ron D. Rothblum |
PCPs and Instance Compression from a Cryptographic Lens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 30:1-30:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Orr Paradise |
Smooth and Strong PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 30(1), pp. 1, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Orr Paradise |
Correction to: Smooth and Strong PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 30(1), pp. 9, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Liron Bronfman, Ron Rothblum |
PCPs and Instance Compression from a Cryptographic Lens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss |
ZK-PCPs from Leakage-Resilient Secret Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 606, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Liron Bronfman, Ron D. Rothblum |
PCPs and Instance Compression from a Cryptographic Lens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 842, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss |
ZK-PCPs from Leakage-Resilient Secret Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021, July 23-26, 2021, Virtual Conference., pp. 6:1-6:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-197-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Jonathan R. Ullman, Salil P. Vadhan |
PCPs and the Hardness of Generating Synthetic Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 33(4), pp. 2078-2112, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
Rigid Matrices From Rectangular PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Dani Kiyasseh, Tingting Zhu 0001, David A. Clifton |
PCPs: Patient Cardiac Prototypes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.14227, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
Rigid Matrices From Rectangular PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.03123, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Orr Paradise |
Smooth and Strong PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA., pp. 2:1-2:41, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-134-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 858-869, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Orr Paradise |
Smooth and Strong PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Mitali Bafna, Nikhil Vyas 0001 |
Imperfect Gaps in Gap-ETH and PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.08185, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai |
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2019, pp. 188, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Moni Naor, Omer Paneth, Guy N. Rothblum |
Incrementally Verifiable Computation via Incremental PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2019, pp. 1407, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Moni Naor, Omer Paneth, Guy N. Rothblum |
Incrementally Verifiable Computation via Incremental PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (2) ![In: Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II, pp. 552-576, 2019, Springer, 978-3-030-36032-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Marta Gomez-Perosanz, Alvaro Ras-Carmona, Pedro A. Reche |
Prediction of proteasomal cleavage sites using PCPS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBM ![In: 2019 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2019, San Diego, CA, USA, November 18-21, 2019, pp. 2137-2140, 2019, IEEE, 978-1-7281-1867-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai |
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (3) ![In: Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III, pp. 67-97, 2019, Springer, 978-3-030-26953-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Mitali Bafna, Nikhil Vyas 0001 |
Imperfect Gaps in Gap-ETH and PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 32:1-32:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Lijie Chen 0001, R. Ryan Williams |
Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 19:1-19:43, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Devanathan Thiruvenkatachari |
Approximation algorithms, Hardness, and PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
22 | Susumu Kiyoshima |
No-signaling Linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2018, pp. 649, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Susumu Kiyoshima |
No-signaling Linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (1) ![In: Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I, pp. 67-97, 2018, Springer, 978-3-030-03806-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza |
Computational Integrity with a Public Random String from Quasi-Linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (3) ![In: Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, pp. 551-579, 2017, 978-3-319-56616-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Or Meir |
Combinatorial PCPs with Short Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 25(1), pp. 1-102, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 63(4), pp. 32:1-32:57, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza |
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR16, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi |
Pointer Quantum PCPs and Multi-Prover Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1603.00903, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza |
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2016, pp. 21, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza |
Computational integrity with a public random string from quasi-linear PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2016, pp. 646, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza |
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (A2) ![In: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II, pp. 33-64, 2016, Springer, 978-3-662-49098-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Yuval Ishai, Mor Weiss, Guang Yang 0020 |
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (A2) ![In: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II, pp. 3-32, 2016, Springer, 978-3-662-49098-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi |
Pointer Quantum PCPs and Multi-Prover Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, pp. 21:1-21:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-016-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Irit Dinur, Prahladh Harsha, Guy Kindler |
Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Irit Dinur, Prahladh Harsha, Guy Kindler |
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.06362, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Yuval Ishai, Mor Weiss, Guang Yang 0020 |
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2015, pp. 1055, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Irit Dinur, Prahladh Harsha, Guy Kindler |
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pp. 267-276, 2015, ACM, 978-1-4503-3536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Or Meir |
Combinatorial PCPs with Efficient Verifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 23(3), pp. 355-478, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Eli Ben-Sasson, Emanuele Viola |
Short PCPs with projection queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR14, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Eli Ben-Sasson, Emanuele Viola |
Short PCPs with Projection Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pp. 163-173, 2014, Springer, 978-3-662-43947-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Irit Dinur, Venkatesan Guruswami |
PCPs via low-degree long code and hardness for constrained hypergraph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Or Meir |
Combinatorial PCPs with Short Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
Constant rate PCPs for circuit-SAT with sublinear query complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Mohammad Mahmoody, David Xiao |
Languages with Efficient Zero-Knowledge PCPs are in SZK. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings, pp. 297-314, 2013, Springer, 978-3-642-36593-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Irit Dinur, Venkatesan Guruswami |
PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pp. 340-349, 2013, IEEE Computer Society, 978-0-7695-5135-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pp. 320-329, 2013, IEEE Computer Society, 978-0-7695-5135-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Rosario Gennaro, Craig Gentry, Bryan Parno, Mariana Raykova 0001 |
Quadratic Span Programs and Succinct NIZKs without PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings, pp. 626-645, 2013, Springer, 978-3-642-38347-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|