Efficient noninteractive certification of RSA moduli and beyond
From MaRDI portal
Publication:2178874
Recommendations
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Hashing solutions instead of generating problems: on the interactive certification of RSA moduli
- scientific article; zbMATH DE number 708823
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Theory of Cryptography
Cited in
(20)- Hashing solutions instead of generating problems: on the interactive certification of RSA moduli
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Certifying variant of RSA with generalized moduli
- Public-key generation with verifiable randomness
- Oblivious transfer from trapdoor permutations in minimal rounds
- scientific article; zbMATH DE number 1588487 (Why is no real title available?)
- scientific article; zbMATH DE number 2085443 (Why is no real title available?)
- Fair encryption of RSA keys
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 1844591 (Why is no real title available?)
- A note on low order assumptions in RSA groups
- Making RSA–PSS Provably Secure against Non-random Faults
- Topics in Cryptology – CT-RSA 2004
- Security analysis of RSA-BSSA
- Certifying giant nonprimes
- 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
- Non-interactive blind signatures from RSA assumption and more
This page was built for publication: Efficient noninteractive certification of RSA moduli and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178874)
