scientific article; zbMATH DE number 1088224
From MaRDI portal
Publication:4364540
zbMath0880.94007MaRDI QIDQ4364540
Tatsuaki Okamoto, Eiichiro Fujisaki
Publication date: 10 February 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
secret sharingelectronic cashRSA signaturesmodular polynomial relationsstatistical zero knowledge protocols
Related Items (53)
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Privacy-preserving blueprints ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ How (not) to design strong-RSA signatures ⋮ Succinct Diophantine-satisfiability arguments ⋮ Programmable hash functions and their applications ⋮ Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial ⋮ On the tightness of forward-secure signature reductions ⋮ Property-Based Attestation without a Trusted Third Party ⋮ Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication ⋮ Secure Authenticated Comparisons ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ The RSA group is pseudo-free ⋮ A Framework for Constructing Convertible Undeniable Signatures ⋮ A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract) ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Programmable Hash Functions and Their Applications ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ Efficient Protocols for Set Membership and Range Proofs ⋮ Cryptographic Assumptions: A Position Paper ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Statistically Hiding Sets ⋮ On the Portability of Generalized Schnorr Proofs ⋮ On the amortized complexity of zero-knowledge protocols ⋮ Transparent SNARKs from DARK compilers ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security ⋮ Filling the gap between voters and cryptography in e-voting ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ Encryption Switching Protocols ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ A new scale-invariant homomorphic encryption scheme ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ On the security of Miyaji et al. group signature scheme ⋮ Proxy signature scheme using self-certified public keys ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
This page was built for publication:
