Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428125
DOI10.1007/b11817zbMath1122.94360OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428125
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Related Items (42)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Smooth NIZK arguments ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ UC-secure and Contributory Password-Authenticated Group Key Exchange ⋮ UC-secure cryptographic reverse firewall-guarding corrupted systems with the minimum trusted module ⋮ Embedding the UC model into the IITM model ⋮ Long-term security and universal composability ⋮ UC priced oblivious transfer with purchase statistics and dynamic pricing ⋮ A new framework for deniable secure key exchange ⋮ A universal composability framework for analysis of proxy threshold signature ⋮ Security Analysis of CPace ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Universally composable symbolic security analysis ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ The IITM model: a simple and expressive model for universal composability ⋮ Joint state composition theorems for public-key encryption and digital signature functionalities with local computation ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Secure computation without authentication ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ A Modular Security Analysis of the TLS Handshake Protocol ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Private set-intersection with common set-up ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ GNUC: a new universal composability framework ⋮ Contributory Password-Authenticated Group Key Exchange with Join Capability ⋮ Ideal Key Derivation and Encryption in Simulation-Based Security ⋮ Legally-Enforceable Fairness in Secure Two-Party Computation ⋮ Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ Safely composing security protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Universally Composable Security Analysis of TLS ⋮ Round Optimal Universally Composable Oblivious Transfer Protocols ⋮ Order-fairness for Byzantine consensus ⋮ Two-round oblivious transfer from CDH or LPN
This page was built for publication: Advances in Cryptology - CRYPTO 2003
