Efficient noninteractive certification of RSA moduli and beyond
From MaRDI portal
Publication:2178874
DOI10.1007/978-3-030-34618-8_24zbMath1456.94078OpenAlexW2989901394MaRDI QIDQ2178874
Foteini Baldimtsi, Omar Sagga, Leonid Reyzin, Sharon Goldberg
Publication date: 11 May 2020
Full work available at URL: https://hdl.handle.net/2144/40861
Related Items (8)
Security analysis of RSA-BSSA ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Public-key generation with verifiable randomness ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ A note on Low Order assumptions in RSA groups
This page was built for publication: Efficient noninteractive certification of RSA moduli and beyond
