Public-key generation with verifiable randomness

DOI10.1007/978-3-030-64837-4_4OpenAlexW3013922659MaRDI QIDQ2692338

Damien Vergnaud, Patrick Towa, Olivier Blazy

Publication date: 21 March 2023

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

zbMATH Keywords

probabilistic circuitscryptographic keykey-generation algorithms

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hashing solutions instead of generating problems: on the interactive certification of RSA moduli
• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
• Efficient noninteractive certification of RSA moduli and beyond
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
• Publicly Verifiable Secret Sharing
• Public Keys
• Cryptographic Reverse Firewalls
• Keying Hash Functions for Message Authentication
• A method for obtaining digital signatures and public-key cryptosystems
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• The Prisoners’ Problem and the Subliminal Channel
• Advances in Cryptology - EUROCRYPT 2004
• Divisible E-Cash Systems Can Be Truly Anonymous
• Public Key Cryptography - PKC 2005
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: Public-key generation with verifiable randomness