Cryptography and cryptographic protocols
From MaRDI portal
Publication:5138490
DOI10.1007/s00446-002-0077-1zbMath1448.94199OpenAlexW2052054442MaRDI QIDQ5138490
Publication date: 4 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-002-0077-1
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
The meeting businessmen problem: requirements and limitations ⋮ General composition and universal composability in secure multiparty computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Probabilistic encryption
- A uniform-complexity treatment of encryption and zero-knowledge
- Definitions and properties of zero-knowledge proof systems
- Player simulation and general adversary structures in perfect multiparty computation
- Security and composition of multiparty cryptographic protocols
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- Complete characterization of security notions for probabilistic private-key encryption
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Keying Hash Functions for Message Authentication
- Universally composable two-party and multi-party secure computation
- Communication Theory of Secrecy Systems*
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- The Knowledge Complexity of Interactive Proof Systems
- New directions in cryptography
- Noninteractive Zero-Knowledge
- Perfectly secure message transmission
- A method for obtaining digital signatures and public-key cryptosystems
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Nonmalleable Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
- Communication preserving protocols for secure function evaluation
- Asynchronous secure computation
- How to withstand mobile virus attacks (extended abstract)
- Asynchronous secure computations with optimal resilience (extended abstract)
- A Zero-One Law for Boolean Privacy
This page was built for publication: Cryptography and cryptographic protocols
