scientific article; zbMATH DE number 1842484
From MaRDI portal
Publication:4783717
zbMath1002.94528MaRDI QIDQ4783717
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Compact and tightly selective-opening secure public-key encryption schemes ⋮ Lifting standard model reductions to common setup assumptions ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Categorical composable cryptography ⋮ Completeness theorems for adaptively secure broadcast ⋮ On concurrent multi-party quantum computation ⋮ On the concurrent composition of quantum zero-knowledge ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Composition with knowledge assumptions ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ The wonderful world of global random oracles ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Universally composable subversion-resilient cryptography ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ Long-term security and universal composability ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Generalizing Efficient Multiparty Computation ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Efficient and universally composable single secret leader election from pairings ⋮ A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure) ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ Universally Composable Cryptographic Role-Based Access Control ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Fully-secure MPC with minimal trust ⋮ Improved straight-line extraction in the random oracle model with applications to signature aggregation ⋮ Triply adaptive UC NIZK ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Black-box anonymous commit-and-prove ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ On constant-round concurrent non-malleable proof systems ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Universally Composable Undeniable Signature ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Robust digital signature revisited ⋮ Non-malleable vector commitments via local equivocability ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Possibility and impossibility results for selective decommitments ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Resource fairness and composability of cryptographic protocols ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Secure computation without authentication ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ All-but-many encryption ⋮ Efficient one-sided adaptively secure computation ⋮ Unconditionally secure quantum bit commitment based on the uncertainty principle ⋮ Everlasting multi-party computation ⋮ On the (im-)possibility of extending coin toss ⋮ Efficient non-malleable commitment schemes ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Cryptography Using Captcha Puzzles ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Efficient non-malleable commitment schemes ⋮ On the (Im-)Possibility of Extending Coin Toss ⋮ A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ The Layered Games Framework for Specifications and Analysis of Security Protocols ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Non-malleable vector commitments via local equivocability ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices ⋮ GNUC: a new universal composability framework ⋮ David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware ⋮ Contributory Password-Authenticated Group Key Exchange with Join Capability ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Cryptography in the multi-string model ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Resettably Secure Computation ⋮ Towards accountability in CRS generation ⋮ On the relationships between notions of simulation-based security ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Universally Composable Private Proximity Testing ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ General composition and universal composability in secure multiparty computation ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens ⋮ On black-box complexity of universally composable security in the CRS model ⋮ On the Necessary and Sufficient Assumptions for UC Computation ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function ⋮ Universally Composable Security Analysis of TLS ⋮ Overcoming impossibility results in composable security using interval-wise guarantees ⋮ Quantifying the security cost of migrating protocols to practice ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication:
