scientific article; zbMATH DE number 1303150
From MaRDI portal
Publication:4249666
zbMath0929.68063MaRDI QIDQ4249666
No author found.
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms ⋮ Efficient Non-interactive Range Proof ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05 ⋮ Fast secure two-party ECDSA signing ⋮ Scalable Divisible E-cash ⋮ On the Portability of Generalized Schnorr Proofs
This page was built for publication:
