Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Noam Zeilberger
Madrid, Spain
software.imdea.org/~noam.zeilberger
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
10
votes
generalizing Ben-Or et al's two-prover bit commitment scheme beyond bits
cr.crypto-security
nt.number-theory
interactive-proofs
zero-knowledge
asked Aug 1 '12 at 12:24
cstheory.stackexchange.com
Top Answers
52
Solid applications of category theory in TCS?
cstheory.stackexchange.com
19
Discharged hypotheses in ->Introduction
cstheory.stackexchange.com
15
What do we know about provably correct programs?
cstheory.stackexchange.com
14
Implicit vs explicit subtyping
cstheory.stackexchange.com
12
How are real numbers specified in computation?
cstheory.stackexchange.com
11
Why do we need formal semantics for predicate logic?
cstheory.stackexchange.com
7
Cut-elimination for calculus with nats or other inductive datatype?
cstheory.stackexchange.com
7
Looking for papers and articles on modal substructural logics
cstheory.stackexchange.com
6
Are there semi-decision procedures for this theory?
cstheory.stackexchange.com
6
Looking for papers and articles on higher-order sequent systems
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
