scientific article

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

randomization signature scheme identification scheme discrete log-cryptosystems exponentiation of random numbers

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

Security properties of one “short” signature scheme ⋮ Information-theoretic secure verifiable secret sharing over RSA modulus ⋮ Hidden Collisions on DSS ⋮ CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ Безопасная реализация электронной подписи с использованием слабодоверенного вычислителя ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Unique-path identity based encryption with applications to strongly secure messaging ⋮ End-to-end secure messaging with traceability only for illegal content ⋮ Asymmetric group message franking: definitions and constructions ⋮ A lower bound on the length of signatures based on group actions and generic isogenies ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ Identity-based encryption in DDH hard groups ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Half-aggregation of Schnorr signatures with tight reductions ⋮ Optimal generic attack against basic Boneh-Boyen signatures ⋮ Sherlock Holmes zero-knowledge protocols ⋮ Efficient ECDSA-based adaptor signature for batched atomic swaps ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ An Efficient Strong Key-Insulated Signature Scheme and Its Application ⋮ Triply adaptive UC NIZK ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Fast two-party signature for upgrading ECDSA to two-party scenario easily ⋮ Anonymous tokens with stronger metadata bit hiding from algebraic MACs ⋮ Identity-based signature and extended forking algorithm in the multivariate quadratic setting ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ End-to-End Verifiable Quadratic Voting with Everlasting Privacy ⋮ Threshold signatures with private accountability ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Lattice-based cryptography: a survey ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks ⋮ EPG-representations with Small Grid-Size ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Subliminal Hash Channels ⋮ Authenticated Group Key Agreement Protocol Without Pairing ⋮ Non-Interactive Key Exchange ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash ⋮ Scalable Multi-party Private Set-Intersection ⋮ Cryptography based on number fields with large regulator ⋮ Improved Bounds on Security Reductions for Discrete Log Based Signatures ⋮ Fast secure two-party ECDSA signing ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis ⋮ SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM ⋮ Unifying Zero-Knowledge Proofs of Knowledge ⋮ Access with pseudonyms ⋮ Public-key cryptography on smart cards ⋮ Leakage-Resilient Signatures ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ Unnamed Item ⋮ Chosen-Ciphertext Secure Proxy Re-encryption without Pairings ⋮ The GPS Identification Scheme Using Frobenius Expansions ⋮ Attacks on Secure Logging Schemes ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ How to Challenge and Cast Your e-Vote ⋮ Practical algorithm substitution attack on extractable signatures ⋮ Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ EPID with malicious revocation ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Cryptography from Learning Parity with Noise ⋮ A conference key distribution system for the star configuration based on the discrete logarithm problem ⋮ FROST: Flexible round-optimized Schnorr threshold signatures ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system ⋮ Generic plaintext equality and inequality proofs ⋮ Integrating authentication in public key distribution system ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ An isogeny-based ID protocol using structured public keys ⋮ Cross-domain attribute-based access control encryption ⋮ Selectively linkable group signatures -- stronger security and preserved verifiability ⋮ Delegation with supervision ⋮ Concurrent signatures from a variety of keys ⋮ Adaptively secure threshold symmetric-key encryption ⋮ Random oracles and non-uniformity ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Short pairing-free blind signatures with exponential security ⋮ Secure parameterized pattern matching

This page was built for publication: