Algebraic adversaries in the universal composability framework
From MaRDI portal
Publication:6157553
Recommendations
Cites work
- A classification of computational assumptions in the algebraic group model
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Complexity of a determinate algorithm for the discrete logarithm
- Composition with knowledge assumptions
- Everybody's a target: scalability in public-key encryption
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the security of time-lock puzzles and timed commitments
- Strong asymmetric PAKE based on trapdoor CKEM
- TARDIS: a foundation of time-lock puzzles in UC
- The algebraic group model and its applications
- The simplest protocol for oblivious transfer
- The wonderful world of global random oracles
- Topics in Cryptology – CT-RSA 2005
- Universally Composable Password-Based Key Exchange
- Universally Composable Security with Global Setup
- Universally composable relaxed password authenticated key exchange
- ``The simplest protocol for oblivious transfer revisited
Cited in
(7)- Fully adaptive Schnorr threshold signatures
- From polynomial IOP and commitments to non-malleable zkSNARKs
- scientific article; zbMATH DE number 7774275 (Why is no real title available?)
- Witness-succinct universally-composable SNARKs
- An analysis of the algebraic group model
- An efficient strong asymmetric PAKE compiler instantiable from group actions
- Universally composable relaxed asymmetric password-authenticated key exchange
This page was built for publication: Algebraic adversaries in the universal composability framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157553)