Universally composable commitments (extended abstract)
From MaRDI portal
Recommendations
- Theory of Cryptography
- Highly-efficient universally-composable commitments based on the DDH assumption
- General composition and universal composability in secure multiparty computation
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Unconditionally secure and universally composable commitments from physical assumptions
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
- Universally Composable Multiparty Computation with Partially Isolated Parties
- Universally Composable Multi-party Computation with an Unreliable Common Reference String
Cited in
(only showing first 100 items - show all)- A note on universal composable zero-knowledge in the common reference string model
- On the relationships between notions of simulation-based security
- Hybrid commitments and their applications to zero-knowledge proof systems
- General composition and universal composability in secure multiparty computation
- Two-round adaptively secure multiparty computation from standard assumptions
- The wonderful world of global random oracles
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Round-efficient black-box construction of composable multi-party computation
- All-but-many encryption
- Secure two-party computation via cut-and-choose oblivious transfer
- On constant-round concurrent non-malleable proof systems
- Everlasting multi-party computation
- On the (im-)possibility of extending coin toss
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Towards accountability in CRS generation
- 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
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- On the concurrent composition of quantum zero-knowledge
- Composition with knowledge assumptions
- Everlasting UC commitments from fully malicious PUFs
- Universally composable subversion-resilient cryptography
- Feasibility and infeasibility of secure computation with malicious PUFs
- Robust digital signature revisited
- DL-extractable UC-commitment schemes
- On black-box complexity of universally composable security in the CRS model
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Lower bounds and impossibility results for concurrent self composition
- The reactive simulatability (RSIM) framework for asynchronous systems
- GNUC: a new universal composability framework
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Non-malleable vector commitments via local equivocability
- Generic construction of UC-secure oblivious transfer
- On the complexity of additively homomorphic UC commitments
- Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
- Adaptive hardness and composable security in the plain model from standard assumptions
- On Adaptively Secure Multiparty Computation with a Short CRS
- Improving practical UC-secure commitments based on the DDH assumption
- Rate-1, linear time and additively homomorphic UC commitments
- UC commitments for modular protocol design and applications to revocation and attribute tokens
- Input-aware equivocable commitments and UC-secure commitments with atomic exchanges
- Unconditionally secure and universally composable commitments from physical assumptions
- Analysis and improvement of Lindell's UC-secure commitment schemes
- Compact and efficient UC commitments under atomic-exchanges
- On constant-round concurrent zero-knowledge from a knowledge assumption
- The simplest protocol for oblivious transfer
- Generalizing efficient multiparty computation
- 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
- Highly-efficient universally-composable commitments based on the DDH assumption
- Contributory password-authenticated group key exchange with join capability
- Universally composable private proximity testing
- Non-interactive and re-usable universally composable string commitments with adaptive security
- A second note on the feasibility of generalized universal composability
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- On the necessary and sufficient assumptions for UC computation
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Universally Composable Undeniable Signature
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- Universally composable incoercibility
- On the (Im-)Possibility of Extending Coin Toss
- Long-Term Security and Universal Composability
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- Universally Composable Adaptive Oblivious Transfer
- Cryptography in the Multi-string Model
- Local Sequentiality Does Not Help for Concurrent Composition
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Resettably Secure Computation
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Efficient non-interactive universally composable string-commitment schemes
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1952890 (Why is no real title available?)
- scientific article; zbMATH DE number 2081077 (Why is no real title available?)
- Impossibility results for universal composability in public-key models and with fixed inputs
- Possibility and impossibility results for selective decommitments
- Generic construction of GUC secure commitment in the KRK model
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Cryptography using \texttt{CAPTCHA} puzzles
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Initiator-resilient universally composable key exchange
- Efficient one-sided adaptively secure computation
- Unconditionally secure quantum bit commitment based on the uncertainty principle
- Several weak bit-commitments using seal-once tamper-evident devices
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- On the complexity of UC commitments
- The Layered Games Framework for Specifications and Analysis of Security Protocols
- A Formal Implementation of Value Commitment
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Universally Composable Security Analysis of TLS
- 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
- On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
This page was built for publication: Universally composable commitments (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783717)
