BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Poland
2 × Canada
5 × USA
Collaborated with:
S.Micali S.Goldwasser R.Ostrovsky T.Ristenpart P.Rogaway C.Lund M.Sudan E.Petrank C.Namprempre G.Neven R.Canetti H.Krawczyk W.Aiello R.Venkatesan O.Goldreich A.Russell A.Russeli
Talks about:
knowledg (4) approxim (3) effici (3) applic (3) zero (3) key (3) probabilist (2) function (2) checkabl (2) statist (2)

Person: Mihir Bellare

DBLP DBLP: Bellare:Mihir

Contributed to:

ICALP 20072007
STOC 19981998
STOC 19951995
STOC 19941994
STOC 19931993
STOC 19921992
STOC 19901990
STOC 19881988

Wrote 13 papers:

ICALP-2007-BellareNN #strict
Unrestricted Aggregate Signatures (MB, CN, GN), pp. 411–422.
ICALP-2007-BellareR #design
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms (MB, TR), pp. 399–410.
STOC-1998-BellareCK #analysis #approach #authentication #composition #design #protocol
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (MB, RC, HK), pp. 419–428.
STOC-1995-AielloBV #statistics
Knowledge on the average-perfect, statistical and logarithmic (WA, MB, RV), pp. 469–478.
STOC-1995-BellareGG #encryption #incremental
Incremental cryptography and application to virus protection (MB, OG, SG), pp. 45–56.
STOC-1995-BellareR
Provably secure session key distribution: the three party case (MB, PR), pp. 57–66.
STOC-1994-BellareGLR #approximate #performance #probability #proving
Efficient probabilistic checkable proofs and applications to approximation (MB, SG, CL, AR), p. 820.
STOC-1994-BellareS
Improved non-approximability results (MB, MS), pp. 184–193.
STOC-1993-BellareGLR #approximate #performance #proving
Efficient probabilistically checkable proofs and applications to approximations (MB, SG, CL, AR), pp. 294–304.
STOC-1992-BellareP #performance #proving
Making Zero-Knowledge Provers Efficient (MB, EP), pp. 711–722.
STOC-1990-BellareMO #constant
Perfect Zero-Knowledge in Constant Rounds (MB, SM, RO), pp. 482–493.
STOC-1990-BellareMO90a #complexity #statistics
The (True) Complexity of Statistical Zero Knowledge (MB, SM, RO), pp. 494–502.
STOC-1988-BellareM #how
How to Sign Given Any Trapdoor Function (MB, SM), pp. 32–42.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.