|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4075 occurrences of 1988 keywords
|
|
|
Results
Found 10042 publication records. Showing 10042 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
72 | Xiaorong Huang |
Translating Machine-Generated Resolution Proofs into ND-Proofs at the Assertion Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI'96: Topics in Artificial Intelligence, 4th Pacific Rim International Conference on Artificial Intelligence, Cairns, Australia, August 26-30, 1996, Proceedings, pp. 399-410, 1996, Springer, 3-540-61532-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
60 | Arnold Beckmann |
Resolution Refutations and Propositional Proofs with Height-Restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 599-612, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Height of proofs, Length of proofs, Resolution refutation, Frege systems, Order induction principle, Cut introduction, MSC: Primary 03F20, Secondary 03F07, 68R99, Cut elimination, 68Q15, Bounded arithmetic, Propositional calculus |
56 | Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin |
Formal certification of code-based cryptographic proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 90-101, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
cryptographic proofs, relational hoare logic, program transformations, observational equivalence, coq proof assistant |
55 | Oded Fuhrmann, Shlomo Hoory |
On Extending Bounded Proofs to Inductive Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, pp. 278-290, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
resolution proofs, extending proofs, proof simplification, Formal verification |
52 | Joan Boyar, René Peralta 0001 |
On the Concrete Complexity of Zero-Knowledge Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings, pp. 507-525, 1989, Springer, 3-540-97317-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
52 | Evan Goris |
Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(2), pp. 185-203, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Logic of proofs, Bounded arithmetic |
52 | Dale Miller 0001 |
Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 7th International Conference on Automated Deduction, Napa, California, USA, May 14-16, 1984, Proceedings, pp. 375-393, 1984, Springer, 3-540-96022-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
Expansion Trees, ET-proofs, Matings, Higher-order Logic, Natural Deduction |
50 | James L. Caldwell |
Moving Proofs-As-Programs into Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 1997 International Conference on Automated Software Engineering, ASE 1997, Lake Tahoe, CA, USA, November 2-5, 1997, pp. 10-17, 1997, IEEE Computer Society, 0-8186-7961-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
proofs-as-programs, constructive type theory, correct-by-construction programs, inductive proofs, Nuprl rewrite system, fixed-point combinators, untyped lambda calculus, specifications, partial evaluation, lambda calculus, hierarchical verifications |
50 | Jan Camenisch, Rafik Chaabouni, Abhi Shelat |
Efficient Protocols for Set Membership and Range Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings, pp. 234-252, 2008, Springer, 978-3-540-89254-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Range proofs, set membership proofs, bi-linear maps, proofs of knowledge |
50 | John Watrous |
Succinct quantum proofs for properties of finite groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 537-546, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
succinct quantum proofs, finite group properties, quantum computational variant, quantum proof, quantum state, NP-type proof, black-box groups, group operations, group oracle, Group Non-Membership problem, bounded error, simple proof, quantum proofs, classical proofs, group properties, computational complexity, theorem proving, quantum computing, quantum computer, certificate, nondeterminism, polynomial time, strings, group theory, finite groups |
46 | Jean-François Dufourd |
A hypermap framework for computer-aided proofs in surface subdivisions: genus theorem and Euler's formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), Seoul, Korea, March 11-15, 2007, pp. 757-761, 2007, ACM, 1-59593-480-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Coq system, Euler's formula, computer-aided proofs, computer-aided proofs in computational topology, genus theorem, hypermaps, formal specifications, subdivisions |
46 | Kamel Barkaoui, Claude Kaiser, Jean-François Pradat-Peyre |
Petri nets based proofs of Ada 95 solution for preference control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 4th Asia-Pacific Software Engineering and International Computer Science Conference (APSEC '97 / ICSC '97), 2-5 December 1997, Clear Water Bay, Hong Kong, pp. 238-248, 1997, IEEE Computer Society, 0-8186-8271-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Petri nets based proofs, preference control, dining philosophers paradigm, entry families, requeue statements, Petri nets, deadlock, colored Petri nets, Ada 95, correctness proofs, starvation, protected objects |
45 | Willem C. Mallon, Jan Tijmen Udding |
Using Metrics for Proof Rules for Recursively Defined Delay-insensitive Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASYNC ![In: 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 7-10 April 1997, Eindhoven, The Netherlands, pp. 175-, 1997, IEEE Computer Society, 0-8186-7922-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
delay-insensitive specifications, recursive definition, linear proofs, intuitive induction rule, algebraic specification, algebraic specifications, theorem provers, correctness proofs, proof rules, proof rule |
45 | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 5, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
counting principles, graph tautologies, algebraic proof systems, binomial proofs, Nullstellensatz proofs, polynomial calculus proofs, propositional logic, Proof complexity |
43 | Ran Raz, Iddo Tzameret |
The Strength of Multilinear Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 407-457, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17, 13P10 |
43 | Aaron Stump, Li-Yang Tan |
The Algebra of Equality Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 469-483, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Xiaorong Huang |
Reconstruction Proofs at the Assertion Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 738-752, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
43 | Matthias Baaz, Richard Zach |
Algorithmic Structuring of Cut-free Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers, pp. 29-42, 1992, Springer, 3-540-56992-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
42 | Michael Backes 0001, Dominique Unruh |
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSF ![In: Proceedings of the 21st IEEE Computer Security Foundations Symposium, CSF 2008, Pittsburgh, Pennsylvania, USA, 23-25 June 2008, pp. 255-269, 2008, IEEE Computer Society, 978-0-7695-3182-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Formal methods, zero-knowledge proofs, computational soundness |
42 | Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum |
Delegating computation: interactive proofs for muggles. ![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. 113-122, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
muggles, delegation, interactive proofs |
41 | Ari Juels, Burton S. Kaliski Jr. |
Pors: proofs of retrievability for large files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007, pp. 584-597, 2007, ACM, 978-1-59593-703-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
proofs of retrievability, storage systems, proofs of knowledge, storage security |
41 | Boaz Barak, Oded Goldreich 0001 |
Universal Arguments and their Applications. ![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. 194-203, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Probabilistic proof systems, computationally-sound proof systems, zero-knowledge proof systems, probabilistic checkable proofs (PCP), collision-free hashing, witness indistinguishable proof systems, error-correcting codes, proofs of knowledge |
39 | Manfred Kerber |
Proofs, proofs, proofs, and proofs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1005.5124, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
39 | Manfred Kerber |
Proofs, Proofs, Proofs, and Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC/MKM/Calculemus ![In: Intelligent Computer Mathematics, 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, July 5-10, 2010. Proceedings, pp. 345-354, 2010, Springer, 978-3-642-14127-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
38 | Dale Miller 0001, Alexis Saurin |
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 405-419, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Evan Goris |
Logic of Proofs for Bounded Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 191-201, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Wim van Dam, Richard D. Gill, Peter Grünwald |
The statistical strength of nonlocality proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(8), pp. 2812-2835, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Caroline Kudla, Kenneth G. Paterson |
Non-interactive Designated Verifier Proofs and Undeniable Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 10th IMA International Conference, Cirencester, UK, December 19-21, 2005, Proceedings, pp. 136-154, 2005, Springer, 3-540-30276-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Tatsuaki Okamoto, Kazuo Ohta |
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings, pp. 134-148, 1989, Springer, 3-540-53433-4. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
38 | Paul Beame, Trinh Huynh, Toniann Pitassi |
Hardness amplification in proof complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 87-96, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
communication complexity, proof complexity |
38 | Jens Groth, Amit Sahai |
Efficient Non-interactive Proof Systems for Bilinear Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings, pp. 415-432, 2008, Springer, 978-3-540-78966-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Non-interactive witness-indistinguishability, common reference string, non-interactive zero-knowledge, bilinear groups |
38 | Pierre-Louis Curien, Giorgio Ghelli |
Coherence of Subsumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings, pp. 132-146, 1990, Springer, 3-540-52590-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
37 | Ariel Cohen 0002, Kedar S. Namjoshi |
Local proofs for global safety properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 34(2), pp. 104-125, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Local proofs, Model checking, Compositionality, Local reasoning |
37 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. ![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. 589-598, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
amplification, natural proofs, black-box, hardness, average-case complexity, constant-depth circuits, majority |
37 | Gérard Le Lann |
A Methodology for Designing and Dimensioning Critical Complex Computing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECBS ![In: IEEE Symposium and Workshop on Engineering of Computer Based Systems (ECBS'96), March 11-15, 1996, Friedrichshafen, Germany., pp. 332-, 1996, IEEE Computer Society, 0-8186-7355-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
design proofs, fault-tolerance, distributed computing, design methodology, complex systems, systems engineering, on-line algorithms, critical systems, real-time computing |
36 | Joe Kilian |
On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 466-477, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
bounded-interaction proofs, bounded-interaction, noninteractive zero-knowledge proofs, committed bits, complexity, cryptographic primitive |
36 | Joe Kilian, Erez Petrank |
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 11(1), pp. 1-27, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Efficient proofs, Noninteractive zero knowledge, Efficient proofs, Noninteractive zero knowledge, Zero knowledge, Zero knowledge, Key words, One-way permutations, One-way permutations, Circuit satisfiability, Circuit satisfiability |
35 | Karine Heydemann, Ulrich Kühne, Letitia Li (eds.) |
Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019 ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![EasyChair The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
35 | Wei Cheng 0003, Claude Carlet, Kouassi Goli, Jean-Luc Danger, Sylvain Guilley |
Detecting Faults in Inner-Product Masking Scheme - IPM-FD: IPM with Fault Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019, pp. 17-32, 2019, EasyChair. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
35 | Fatemeh Ganji, Shahin Tajik, Pascal Stauss, Jean-Pierre Seifert, Domenic Forte, Mark M. Tehranipoor |
Rock'n'roll PUFs: Crafting Provably Secure PUFs from Less Secure Ones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019, pp. 33-48, 2019, EasyChair. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
35 | Rei Ueno, Junko Takahashi, Yu-ichi Hayashi, Naofumi Homma |
Constructing Sliding Windows Leak from Noisy Cache Timing Information of OSS-RSA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019, pp. 64-77, 2019, EasyChair. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
35 | Osnat Keren, Ilia Polian |
A comment on information leakage from robust code-based checkers detecting fault attacks on cryptographic primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019, pp. 49-63, 2019, EasyChair. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
35 | Sébastien Carré, Victor Dyseryn, Adrien Facon, Sylvain Guilley, Thomas Perianin |
End-to-end automated cache-timing attack driven by Machine Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019, pp. 1-16, 2019, EasyChair. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
35 | Lejla Batina, Ulrich Kühne, Nele Mentens (eds.) |
PROOFS 2018, 7th International Workshop on Security Proofs for Embedded Systems, colocated with CHES 2018, Amsterdam, The Netherlands, September 13, 2018 ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![EasyChair The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
35 | Akira Ito, Rei Ueno, Naofumi Homma, Takafumi Aoki |
A Non-Reversible Insertion Method for Hardware Trojans Based on Path Delay Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2018, 7th International Workshop on Security Proofs for Embedded Systems, colocated with CHES 2018, Amsterdam, The Netherlands, September 13, 2018, pp. 50-67, 2018, EasyChair. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
35 | Muhammad Ali Siddiqi, Robert M. Seepers, Mohammad Hamad, Vassilis Prevelakis, Christos Strydis |
Attack-tree-based Threat Modeling of Medical Implants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2018, 7th International Workshop on Security Proofs for Embedded Systems, colocated with CHES 2018, Amsterdam, The Netherlands, September 13, 2018, pp. 32-49, 2018, EasyChair. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
35 | Danilo Sijacic, Josep Balasch, Bohan Yang 0001, Santosh Ghosh, Ingrid Verbauwhede |
Towards Efficient and Automated Side Channel Evaluations at Design Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2018, 7th International Workshop on Security Proofs for Embedded Systems, colocated with CHES 2018, Amsterdam, The Netherlands, September 13, 2018, pp. 16-31, 2018, EasyChair. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
35 | Manaar Alam, Debdeep Mukhopadhyay, Sai Praveen Kadiyala, Siew Kei Lam, Thambipillai Srikanthan |
Side-Channel Assisted Malware Classifier with Gradient Descent Correction for Embedded Platforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2018, 7th International Workshop on Security Proofs for Embedded Systems, colocated with CHES 2018, Amsterdam, The Netherlands, September 13, 2018, pp. 1-15, 2018, EasyChair. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
35 | Batya Karp, Maël Gay, Osnat Keren, Ilia Polian |
Detection and Correction of Malicious and Natural Faults in Cryptographic Modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2018, 7th International Workshop on Security Proofs for Embedded Systems, colocated with CHES 2018, Amsterdam, The Netherlands, September 13, 2018, pp. 68-82, 2018, EasyChair. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
35 | Ulrich Kühne, Jean-Luc Danger, Sylvain Guilley (eds.) |
PROOFS 2017, 6th International Workshop on Security Proofs for Embedded Systems, Taipei, Taiwan, September 29th, 2017 ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![EasyChair The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
35 | Sayandeep Saha, Ujjawal Kumar, Debdeep Mukhopadhyay, Pallab Dasgupta |
An Automated Framework for Exploitable Fault Identification in Block Ciphers - A Data Mining Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2017, 6th International Workshop on Security Proofs for Embedded Systems, Taipei, Taiwan, September 29th, 2017, pp. 50-67, 2017, EasyChair. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
35 | Poulami Das 0003, Debapriya Basu Roy, Debdeep Mukhopadhyay |
Automatic Generation of HCCA Resistant Scalar Multiplication Algorithm by Proper Sequencing of Field Multiplier Operands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2017, 6th International Workshop on Security Proofs for Embedded Systems, Taipei, Taiwan, September 29th, 2017, pp. 33-49, 2017, EasyChair. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
35 | Nils Wisiol, Christoph Graebnitz, Marian Margraf, Manuel Oswald, Tudor A. A. Soroceanu, Benjamin Zengin |
Why Attackers Lose: Design and Security Analysis of Arbitrarily Large XOR Arbiter PUFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2017, 6th International Workshop on Security Proofs for Embedded Systems, Taipei, Taiwan, September 29th, 2017, pp. 68-83, 2017, EasyChair. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
35 | Christoph Baumann, Oliver Schwarz, Mads Dam |
Compositional Verification of Security Properties for Embedded Execution Platforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2017, 6th International Workshop on Security Proofs for Embedded Systems, Taipei, Taiwan, September 29th, 2017, pp. 1-16, 2017, EasyChair. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
35 | Inès Ben El Ouahma, Quentin L. Meunier, Karine Heydemann, Emmanuelle Encrenaz |
Symbolic Approach for Side-Channel Resistance Analysis of Masked Assembly Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROOFS ![In: PROOFS 2017, 6th International Workshop on Security Proofs for Embedded Systems, Taipei, Taiwan, September 29th, 2017, pp. 17-32, 2017, EasyChair. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
35 | B. Malcolm Brown, Erich L. Kaltofen, Shin'ichi Oishi, Siegfried M. Rump |
09471 Abstracts Collection - Computer-assisted proofs - tools, methods and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer-assisted proofs - tools, methods and applications ![In: Computer-assisted proofs - tools, methods and applications, 15.11. - 20.11.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
35 | B. Malcolm Brown, Erich L. Kaltofen, Shin'ichi Oishi, Siegfried M. Rump |
09471 Executive Summary - Computer-assisted proofs - tools, methods and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer-assisted proofs - tools, methods and applications ![In: Computer-assisted proofs - tools, methods and applications, 15.11. - 20.11.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
35 | Thierry Coquand, Henri Lombardi, Marie-Françoise Roy |
05021 Abstracts Collection -- Mathematics, Algorithms, Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mathematics, Algorithms, Proofs ![In: Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
35 | Thierry Coquand |
05021 Executive Summary -- Mathematics, Algorithms, Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mathematics, Algorithms, Proofs ![In: Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
35 | Julio Rubio Garcia |
Constructive Proofs or Constructive Statements?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mathematics, Algorithms, Proofs ![In: Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
35 | Bruno Buchberger, Shin'ichi Oishi, Michael Plum, Siegfried M. Rump |
05391 Abstracts Collection - Algebraic and Numerical Algorithms and Computer-assisted Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic and Numerical Algorithms and Computer-assisted Proofs ![In: Algebraic and Numerical Algorithms and Computer-assisted Proofs, 25.-30. September 2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
35 | Bruno Buchberger, Christian Jansson, Shin'ichi Oishi, Michael Plum, Siegfried M. Rump |
05391 Executive Summary - Numerical and Algebraic Algorithms and Computer-assisted Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic and Numerical Algorithms and Computer-assisted Proofs ![In: Algebraic and Numerical Algorithms and Computer-assisted Proofs, 25.-30. September 2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
34 | Andreas Meier 0002 |
System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings, pp. 460-464, 2000, Springer, 3-540-67664-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Michael Backes 0001, Dennis Hofheinz, Dominique Unruh |
CoSP: a general framework for computational soundness proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, Chicago, Illinois, USA, November 9-13, 2009, pp. 66-78, 2009, ACM, 978-1-60558-894-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
security, verification, theory |
33 | René Thiemann, Christian Sternagel |
Certification of Termination Proofs Using CeTA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings, pp. 452-468, 2009, Springer, 978-3-642-03358-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Kaustuv Chaudhuri, Dale Miller 0001, Alexis Saurin |
Canonical Sequent Proofs via Multi-Focusing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy, pp. 383-396, 2008, Springer, 978-0-387-09679-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mateja Jamnik, Alan Bundy |
Psychological Validity of Schematic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mechanizing Mathematical Reasoning ![In: Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, pp. 321-341, 2005, Springer, 3-540-25051-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Michael Ben-Or, Danny Gutfreund |
Trading Help for Interaction in Statistical Zero-Knowledge Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 16(2), pp. 95-116, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Zero-knowledge, Graph isomorphism, Non-interactive zero-knowledge |
33 | Iman Poernomo |
Proofs-as-Imperative-Programs: Application to Synthesis of Contracts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers, pp. 112-119, 2003, Springer, 3-540-20813-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao |
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(4), pp. 555-574, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 03F20, 68Q17 |
33 | Albert Atserias, Nicola Galesi, Ricard Gavaldà |
Monotone Proofs of the Pigeon Hole Principle. ![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. 151-162, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Joan Boyar, Katalin Friedl, Carsten Lund |
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings, pp. 155-172, 1989, Springer, 3-540-53433-4. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
33 | Matthias Baaz |
Proof Analysis by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings, pp. 1, 2002, Springer, 3-540-43929-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Steven Gianvecchio, Zhenyu Wu, Mengjun Xie, Haining Wang |
Battle of Botcraft: fighting bots in online games with human observational proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, Chicago, Illinois, USA, November 9-13, 2009, pp. 256-268, 2009, ACM, 978-1-60558-894-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
game bots, human observational proofs |
32 | Judicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade 0001, Yassine Lakhnech |
Towards automated proofs for asymmetric encryption schemes in the random oracle model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 2008 ACM Conference on Computer and Communications Security, CCS 2008, Alexandria, Virginia, USA, October 27-31, 2008, pp. 371-380, 2008, ACM, 978-1-59593-810-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
asymmetric encryption, automated proofs, provable security, hoare logics, random oracle model |
32 | Thomas Ristenpart, Scott Yilek |
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, pp. 228-245, 2007, Springer, 978-3-540-72539-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Proofs of possession, PKI, bilinear maps, ring signatures, multisignatures |
32 | Koji Chida, Go Yamamoto |
Batch Processing of Interactive Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2007, The Cryptographers' Track at the RSA Conference 2007, San Francisco, CA, USA, February 5-9, 2007, Proceedings, pp. 196-207, 2007, Springer, 3-540-69327-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Sigma-Protocols, Batch Processing, Proofs of Knowledge |
32 | Irene Polycarpou |
Computer science students' difficulties with proofs by induction: an exploratory study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 601-606, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
inductive/recursive definitions, undergraduate computer science curricula, structural induction, proofs by induction |
32 | Klaus Meer |
Transparent Long Proofs: A First PCP Theorem for NPR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 5(3), pp. 231-255, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Real number complexity, Verifiers, Probabilistically checkable proofs |
32 | Peter B. Andrews, Chad E. Brown, Frank Pfenning, Matthew Bishop, Sunil Issar, Hongwei Xi |
ETPS: A System to Help Students Write Formal Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 32(1), pp. 75-92, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ETPS, GRADER, teaching logic, education, proofs |
32 | Sultan Almuhammadi, Nien T. Sui, Dennis McLeod |
Better Privacy and Security in E-Commerce: Using Elliptic Curve-Based Zero-Knowledge Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: 2004 IEEE International Conference on E-Commerce Technology (CEC 2004), 6-9 July 2004, San Diego, CA, USA, pp. 299-302, 2004, IEEE Computer Society, 0-7695-2098-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
security, privacy, E-commerce, elliptic curves, zero-knowledge proofs |
32 | Henry S. Baird, Kris Popat |
Human Interactive Proofs and Document Image Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Document Analysis Systems ![In: Document Analysis Systems V, 5th International Workshop, DAS 2002, Princeton, NJ, USA, August 19-21, 2002, Proceedings, pp. 507-518, 2002, Springer, 3-540-44068-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
abuse of web sites and services, the chatroom problem, human/machine discrimination, OCR performance evaluation, legibility of text, document image analysis, CAPTCHAs, Turing tests, Human interactive proofs, document image degradations |
32 | Oded Goldreich 0001, Salil P. Vadhan, Avi Wigderson |
On Interactive Proofs with a Laconic Prover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 334-345, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
sampling protocols, statistical zero knowledge, game theory, interactive proofs, Arthur-Merlin games |
32 | Jon Whittle 0001, Alan Bundy, Richard J. Boulton, Helen Lowe |
An ML Editor Based on Proofs-As-Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: The 14th IEEE International Conference on Automated Software Engineering, ASE 1999, Cocoa Beach, Florida, USA, 12-15 October 1999, pp. 166-173, 1999, IEEE Computer Society, 0-7695-0415-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
proofs-as-programs, termination proof, Functional programming |
32 | Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy |
Interactive Proofs and the Hardness of Approximating Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(2), pp. 268-292, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
independent set in a graph, multilinearity testing np-completeness, hardness of approximation, probabilistically checkable proofs |
32 | Irene Polycarpou, Ana Pasztor, Malek Adjouadi |
A conceptual approach to teaching induction for computer science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2008, Portland, OR, USA, March 12-15, 2008, pp. 9-13, 2008, ACM, 978-1-59593-799-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
induction principle, inductive sets, logic for computer science, undergraduate computer science curricula, computer science education, proofs by induction |
32 | Søren Riis |
A complexity gap for tree resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(3), pp. 179-209, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Logical aspects of complexity, resolution proofs, propositional proof complexity |
29 | Benjamin Ralph |
Herbrand Proofs and Expansion Proofs as Decomposed Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 30(8), pp. 1711-1742, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
29 | Giuseppe Longo |
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers, pp. 160-180, 2000, Springer, 3-540-43287-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Nathan Segerlind |
On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 100-111, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
lower bounds, resolution, ordered binary decision diagrams, propositional proof complexity |
29 | Kumar Chellapilla, Kevin Larson, Patrice Y. Simard, Mary Czerwinski |
Building Segmentation Based Human-Friendly Human Interaction Proofs (HIPs). ![Search on Bibsonomy](Pics/bibsonomy.png) |
HIP ![In: Human Interactive Proofs, Second International Workshop, HIP 2005, Bethlehem, PA, USA, May 19-20, 2005, Proceedings, pp. 1-26, 2005, Springer, 3-540-26001-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Amy P. Felty |
A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ELP ![In: Extensions of Logic Programming, International Workshop, Tübingen, FRG, December 8-10, 1989, Proceedings, pp. 157-178, 1989, Springer, 3-540-53590-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
29 | Jens Oehlerking, Oliver E. Theel |
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings, pp. 151-165, 2009, Springer, 978-3-642-04760-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Aggelos Kiayias, Hong-Sheng Zhou |
Zero-Knowledge Proofs with Witness Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2009, 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18-20, 2009. Proceedings, pp. 124-138, 2009, Springer, 978-3-642-00467-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Stefan Saroiu, Alec Wolman |
Enabling new mobile applications with location proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HotMobile ![In: Proceedings of the 10th Workshop on Mobile Computing Systems and Applications, HotMobile 2009, Santa Cruz, California, USA, February 23-24, 2009, 2009, ACM, 978-1-60558-283-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham |
Randomizable Proofs and Delegatable Anonymous Credentials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings, pp. 108-125, 2009, Springer, 978-3-642-03355-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Sergei N. Artëmov |
Symmetric Logic of Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pillars of Computer Science ![In: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, pp. 58-71, 2008, Springer, 978-3-540-78126-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Dale Miller 0001, Vivek Nigam |
Incorporating Tables into Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 466-480, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Scott Aaronson, Greg Kuperberg |
Quantum versus Classical Proofs and Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 115-128, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Alexis Maciel, Toniann Pitassi |
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pp. 189-200, 2006, IEEE Computer Society, 0-7695-2631-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 10042 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|