Person: Moti Yung

DBLP: Yung:Moti

Facilitated 1 volumes:

Ed

Contributed to:

2012

2011

2010

2009

2003

2002

2001

2000

1998

1998

1997

1996

1996

1995

1995

1994

1994

1993

1992

1992

1990

1989

1989

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.

STOC-1990-NaorY

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.