Algebraic adversaries in the universal composability framework

DOI10.1007/978-3-030-92078-4_11zbMath1514.94026OpenAlexW3203555989MaRDI QIDQ6157553

Jonathan N. Katz, Julian Loss, Jiayu Xu, Michel Abdalla, Manuel Barbosa

Publication date: 12 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_11

zbMATH Keywords

universal composabilityalgebraic-group model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Witness-succinct universally-composable SNARKs ⋮ An analysis of the algebraic group model ⋮ Fully adaptive Schnorr threshold signatures

Cites Work

• ``The simplest protocol for oblivious transfer revisited
• The wonderful world of global random oracles
• The algebraic group model and its applications
• Complexity of a determinate algorithm for the discrete logarithm
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Everybody's a target: scalability in public-key encryption
• TARDIS: a foundation of time-lock puzzles in UC
• Universally composable relaxed password authenticated key exchange
• A classification of computational assumptions in the algebraic group model
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• On the security of time-lock puzzles and timed commitments
• Composition with knowledge assumptions
• Strong asymmetric PAKE based on trapdoor CKEM
• The Simplest Protocol for Oblivious Transfer
• Universally Composable Security with Global Setup
• Universally Composable Password-Based Key Exchange
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: Algebraic adversaries in the universal composability framework