BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Denmark
1 × France
1 × Germany
1 × Hungary
1 × Israel
1 × Spain
1 × Sweden
1 × Switzerland
1 × The Netherlands
1 × United Kingdom
2 × Canada
2 × Greece
2 × Italy
6 × USA
Collaborated with:
A.Kiayias M.K.Franklin Y.Frankel B.Libert M.Naor A.D.Santis G.D.Crescenzo G.Persiano J.Katz X.Yu S.E.Nikoletseas P.G.Spirakis A.C.Yao Y.Zhao D.Bleichenbacher K.Sakurai P.D.MacKenzie P.Gemmell G.Brassard C.Crépeau M.O.Rabin Y.Mansour S.Muthukrishnan M.H.Ibrahim H.Zhou J.H.Reif K.V.Palem Y.Desmedt A.J.Mayer Y.Ofek R.Ostrovsky
Talks about:
secur (9) knowledg (5) key (5) function (4) effici (4) zero (4) cryptograph (3) encrypt (3) complet (3) public (3)

Person: Moti Yung

DBLP DBLP: Yung:Moti

Facilitated 1 volumes:

ICALP 2005Ed

Contributed to:

ICALP (1) 20122012
ICALP (2) 20112011
ICALP (1) 20102010
ICALP (2) 20092009
ICALP 20032003
ICALP 20022002
ICALP 20012001
STOC 20002000
ICALP 19981998
STOC 19981998
ICALP 19971997
ICALP 19961996
STOC 19961996
ICALP 19951995
STOC 19951995
ICALP 19941994
STOC 19941994
ICALP 19931993
ICALP 19921992
STOC 19921992
STOC 19901990
ICALP 19891989
STOC 19891989

Wrote 26 papers:

ICALP-v1-2012-RabinMMY #performance #strict #transaction #validation
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (MOR, YM, SM, MY), pp. 738–749.
ICALP-v2-2011-LibertY #adaptation
Adaptively Secure Non-interactive Threshold Cryptosystems (BL, MY), pp. 588–600.
ICALP-v1-2010-LibertY #encryption #performance
Efficient Completely Non-malleable Public Key Encryption (BL, MY), pp. 127–139.
ICALP-v1-2010-YaoYZ #concurrent
Concurrent Knowledge Extraction in the Public-Key Model (ACCY, MY, YZ), pp. 702–714.
ICALP-v2-2009-IbrahimKYZ #sublinear
Secure Function Collection with Sublinear Storage (MHI, AK, MY, HSZ), pp. 534–545.
ICALP-2003-BleichenbacherKY #semistructured data
Decoding of Interleaved Reed Solomon Codes over Noisy Data (DB, AK, MY), pp. 97–108.
ICALP-2002-KiayiasY #encryption
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes (AK, MY), pp. 232–243.
ICALP-2001-KiayiasY #game studies #polynomial
Secure Games with Polynomial Expressions (AK, MY), pp. 939–950.
STOC-2000-CrescenzoSY #on the #proving
On zero-knowledge proofs (extended abstract): “from membership to decision” (GDC, KS, MY), pp. 255–264.
STOC-2000-KatzY #encryption #probability #security
Complete characterization of security notions for probabilistic private-key encryption (JK, MY), pp. 245–254.
ICALP-1998-SantisCPY #image
Image Density is Complete for Non-Interactive-SZK (ADS, GDC, GP, MY), pp. 784–795.
STOC-1998-FrankelMY #distributed #generative #performance #robust
Robust Efficient Distributed RSA-Key Generation (YF, PDM, MY), pp. 663–672.
ICALP-1997-FrankelY #encryption #on the
On Characterization of Escrow Encryption Schemes (YF, MY), pp. 705–715.
ICALP-1996-YuY #problem #symmetry
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem (XY, MY), pp. 610–621.
STOC-1996-FrankelGY #encryption #robust
Witness-Based Cryptographic Program Checking and Robust Function Sharing (YF, PG, MY), pp. 499–508.
ICALP-1995-NikoletseasRSY #graph #memory management #probability
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.
STOC-1995-FranklinY #privacy
Secure hypergraphs: privacy from partial broadcast (MKF, MY), pp. 36–44.
ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.
STOC-1994-SantisDFY #how
How to share a function securely (ADS, YD, YF, MY), pp. 522–533.
ICALP-1993-FranklinY #performance
Secure and Efficient Off-Line Digital Money (MKF, MY), pp. 265–276.
ICALP-1992-SantisPY #bound #proving #statistics #verification
One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier (ADS, GP, MY), pp. 28–40.
STOC-1992-FranklinY #communication #complexity
Communication Complexity of Secure Computation (MKF, MY), pp. 699–710.
STOC-1992-MayerOOY #self #symmetry
Self-Stabilizing Symmetry Breaking in Constant-Space (AJM, YO, RO, MY), pp. 667–678.
Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (MN, MY), pp. 427–437.
ICALP-1989-BrassardC #bound
Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (GB, CC, MY), pp. 123–136.
STOC-1989-NaorY #encryption
Universal One-Way Hash Functions and their Cryptographic Applications (MN, MY), pp. 33–43.

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.