|
|
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. |
PRICAI |
1996 |
DBLP DOI BibTeX RDF |
|
60 | Arnold Beckmann |
Resolution Refutations and Propositional Proofs with Height-Restrictions. |
CSL |
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. |
POPL |
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. |
CAV |
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. |
CRYPTO |
1989 |
DBLP DOI BibTeX RDF |
|
52 | Evan Goris |
Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Logic of proofs, Bounded arithmetic |
52 | Dale Miller 0001 |
Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs. |
CADE |
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. |
ASE |
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. |
ASIACRYPT |
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. |
FOCS |
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. |
SAC |
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. |
APSEC |
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. |
ASYNC |
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). |
CCC |
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. |
Comput. Complex. |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17, 13P10 |
43 | Aaron Stump, Li-Yang Tan |
The Algebra of Equality Proofs. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Xiaorong Huang |
Reconstruction Proofs at the Assertion Level. |
CADE |
1994 |
DBLP DOI BibTeX RDF |
|
43 | Matthias Baaz, Richard Zach |
Algorithmic Structuring of Cut-free Proofs. |
CSL |
1992 |
DBLP DOI BibTeX RDF |
|
42 | Michael Backes 0001, Dominique Unruh |
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. |
CSF |
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. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
muggles, delegation, interactive proofs |
41 | Ari Juels, Burton S. Kaliski Jr. |
Pors: proofs of retrievability for large files. |
CCS |
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. |
CCC |
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 |
CoRR |
2010 |
DBLP BibTeX RDF |
|
39 | Manfred Kerber |
Proofs, Proofs, Proofs, and Proofs. |
AISC/MKM/Calculemus |
2010 |
DBLP DOI BibTeX RDF |
|
38 | Dale Miller 0001, Alexis Saurin |
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Evan Goris |
Logic of Proofs for Bounded Arithmetic. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Wim van Dam, Richard D. Gill, Peter Grünwald |
The statistical strength of nonlocality proofs. |
IEEE Trans. Inf. Theory |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Caroline Kudla, Kenneth G. Paterson |
Non-interactive Designated Verifier Proofs and Undeniable Signatures. |
IMACC |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Tatsuaki Okamoto, Kazuo Ohta |
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility. |
EUROCRYPT |
1989 |
DBLP DOI BibTeX RDF |
|
38 | Paul Beame, Trinh Huynh, Toniann Pitassi |
Hardness amplification in proof complexity. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
communication complexity, proof complexity |
38 | Jens Groth, Amit Sahai |
Efficient Non-interactive Proof Systems for Bilinear Groups. |
EUROCRYPT |
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. |
CAAP |
1990 |
DBLP DOI BibTeX RDF |
|
37 | Ariel Cohen 0002, Kedar S. Namjoshi |
Local proofs for global safety properties. |
Formal Methods Syst. Des. |
2009 |
DBLP DOI BibTeX RDF |
Local proofs, Model checking, Compositionality, Local reasoning |
37 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. |
STOC |
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. |
ECBS |
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 |
FOCS |
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. |
J. Cryptol. |
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 |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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 |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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 |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
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. |
PROOFS |
2017 |
DBLP DOI BibTeX RDF |
|
35 | Christoph Baumann, Oliver Schwarz, Mads Dam |
Compositional Verification of Security Properties for Embedded Execution Platforms. |
PROOFS |
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. |
PROOFS |
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. |
Computer-assisted proofs - tools, methods and applications |
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. |
Computer-assisted proofs - tools, methods and applications |
2009 |
DBLP BibTeX RDF |
|
35 | Thierry Coquand, Henri Lombardi, Marie-Françoise Roy |
05021 Abstracts Collection -- Mathematics, Algorithms, Proofs. |
Mathematics, Algorithms, Proofs |
2005 |
DBLP BibTeX RDF |
|
35 | Thierry Coquand |
05021 Executive Summary -- Mathematics, Algorithms, Proofs. |
Mathematics, Algorithms, Proofs |
2005 |
DBLP BibTeX RDF |
|
35 | Julio Rubio Garcia |
Constructive Proofs or Constructive Statements?. |
Mathematics, Algorithms, Proofs |
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. |
Algebraic and Numerical Algorithms and Computer-assisted Proofs |
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. |
Algebraic and Numerical Algorithms and Computer-assisted Proofs |
2005 |
DBLP BibTeX RDF |
|
34 | Andreas Meier 0002 |
System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level. |
CADE |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Michael Backes 0001, Dennis Hofheinz, Dominique Unruh |
CoSP: a general framework for computational soundness proofs. |
CCS |
2009 |
DBLP DOI BibTeX RDF |
security, verification, theory |
33 | René Thiemann, Christian Sternagel |
Certification of Termination Proofs Using CeTA. |
TPHOLs |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Kaustuv Chaudhuri, Dale Miller 0001, Alexis Saurin |
Canonical Sequent Proofs via Multi-Focusing. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mateja Jamnik, Alan Bundy |
Psychological Validity of Schematic Proofs. |
Mechanizing Mathematical Reasoning |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Michael Ben-Or, Danny Gutfreund |
Trading Help for Interaction in Statistical Zero-Knowledge Proofs. |
J. Cryptol. |
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. |
Ershov Memorial Conference |
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. |
Comb. |
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. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Joan Boyar, Katalin Friedl, Carsten Lund |
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. |
EUROCRYPT |
1989 |
DBLP DOI BibTeX RDF |
|
33 | Matthias Baaz |
Proof Analysis by Resolution. |
TABLEAUX |
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. |
CCS |
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. |
CCS |
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. |
EUROCRYPT |
2007 |
DBLP DOI BibTeX RDF |
Proofs of possession, PKI, bilinear maps, ring signatures, multisignatures |
32 | Koji Chida, Go Yamamoto |
Batch Processing of Interactive Proofs. |
CT-RSA |
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. |
ACM Southeast Regional Conference |
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. |
Found. Comput. Math. |
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. |
J. Autom. Reason. |
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. |
CEC |
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. |
Document Analysis Systems |
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. |
ICALP |
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. |
ASE |
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. |
J. ACM |
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. |
SIGCSE |
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. |
Comput. Complex. |
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. |
J. Log. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
29 | Giuseppe Longo |
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory. |
TYPES |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Nathan Segerlind |
On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. |
CCC |
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). |
HIP |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Amy P. Felty |
A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs. |
ELP |
1989 |
DBLP DOI BibTeX RDF |
|
29 | Jens Oehlerking, Oliver E. Theel |
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems. |
ATVA |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Aggelos Kiayias, Hong-Sheng Zhou |
Zero-Knowledge Proofs with Witness Elimination. |
Public Key Cryptography |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Stefan Saroiu, Alec Wolman |
Enabling new mobile applications with location proofs. |
HotMobile |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham |
Randomizable Proofs and Delegatable Anonymous Credentials. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Sergei N. Artëmov |
Symmetric Logic of Proofs. |
Pillars of Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Dale Miller 0001, Vivek Nigam |
Incorporating Tables into Proofs. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Scott Aaronson, Greg Kuperberg |
Quantum versus Classical Proofs and Advice. |
CCC |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Alexis Maciel, Toniann Pitassi |
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. |
LICS |
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][ >>] |
|