Theory of Cryptography

DOI10.1007/B95566zbMath1176.94069OpenAlexW2498336418MaRDI QIDQ5901773

Yehuda Lindell

Publication date: 14 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95566

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (18)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Concurrently composable non-interactive secure computation ⋮ On concurrent multi-party quantum computation ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Secure computation without authentication ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ Resettably Secure Computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ General composition and universal composability in secure multiparty computation ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge

This page was built for publication: Theory of Cryptography