Universally composable security: a new paradigm for cryptographic protocols
From MaRDI portal
Cited in
(26)- UC4Free! Existing threshold signatures are UC secure
- Two-party ECDSA signing at constant communication overhead
- ETK: external-operations TreeKEM and the security of MLS in RFC 9420
- Combining oblivious pseudorandom functions
- OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
- Device-bound anonymous credentials with(out) trusted hardware
- Updatable private set intersection from symmetric-key techniques
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
- Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph
- Simple two-message OT in the explicit isogeny model
- Feldman's verifiable secret sharing for a dishonest majority
- Simple three-round multiparty Schnorr signing with full simulatability
- Efficient maliciously secure oblivious exponentiations
- Constant-round YOSO MPC without setup
- A new paradigm for server-aided MPC
- HELP: everlasting privacy through server-aided randomness
- On quantum simulation-soundness
- Perfectly secure fluid MPC with abort and linear communication complexity
- Tighter concrete security for the simplest OT
- Anonymous reputation systems with revocation, revisited
- Revisiting module lattice-based homomorphic encryption and application to secure-MPC
- Constructive Cryptography in HOL
- Threshold oblivious pseudorandom functions from isogeny group actions
- On the simulation-extractability of proof-carrying data
This page was built for publication: Universally composable security: a new paradigm for cryptographic protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240044)
