scientific article; zbMATH DE number 4191111
From MaRDI portal
Publication:3210171
Recommendations
Cited in
(only showing first 100 items - show all)- Security proofs for identity-based identification and signature schemes
- Efficient signature generation by smart cards
- An interactive identification scheme based on discrete logarithms and factoring
- Almost everywhere high nonuniform complexity
- Elliptic curve cryptosystems and their implementation
- Server-aided honest computation for cryptographic applications
- Integrating authentication in public key distribution system
- Random small Hamming weight products with applications to cryptography
- Improved low-computation partially blind signatures.
- Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system
- Random oracles and non-uniformity
- Bootstrapping for approximate homomorphic encryption
- Optimal forgeries against polynomial-based MACs and GCM
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Public key compression for constrained linear signature schemes
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- A threshold signature scheme based on the elliptic curve cryptosystem
- Efficient on-line electronic checks
- Adaptively secure distributed public-key systems.
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Threshold ECDSA with an offline recovery party
- Stacked garbling for disjunctive zero-knowledge proofs
- MPSign: a signature from small-secret middle-product learning with errors
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Threshold schemes from isogeny assumptions
- Efficient redactable signature and application to anonymous credentials
- Aggregatable distributed key generation
- Improving revocation for group signature with redactable signature
- More efficient digital signatures with tight multi-user security
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
- On removing rejection conditions in practical lattice-based signatures
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Practical algorithm substitution attack on extractable signatures
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- A compressed \(\varSigma \)-protocol theory for lattices
- Does Fiat-Shamir require a cryptographic hash function?
- Generic plaintext equality and inequality proofs
- 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
- Concurrent signatures from a variety of keys
- Adaptively secure threshold symmetric-key encryption
- 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
- On the Menezes-Teske-Weng conjecture
- Forward-secure ID based digital signature scheme with forward-secure private key generator
- Robust digital signature revisited
- An efficient eCK secure identity based two party authenticated key agreement scheme with security against active adversaries
- Cryptographic reverse firewalls for interactive proof systems
- Strongly secure identity-based authenticated key agreement protocols without bilinear pairings
- Cryptanalysis of a rank-based signature with short public keys
- A probabilistic analysis on a lattice attack against DSA
- IND-CCA secure encryption based on a Zheng-Seberry scheme
- Delegation with supervision
- On tight security proofs for Schnorr signatures
- Security reconsideration of the Huang-Wang nominative signature
- A novel efficient \((t,n)\) threshold proxy signature scheme
- Speeding up exponentiation using an untrusted computational resource
- Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
- Secure parameterized pattern matching
- Towards self-stabilizing blockchain, reconstructing totally erased blockchain
- On tightly-secure (linkable) ring signatures
- On the impossibility of purely algebraic signatures
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Scalable Divisible E-cash
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Improved OR-composition of sigma-protocols
- Accountable large-universe attribute-based encryption supporting any monotone access structures
- Fuzzy signatures: relaxing requirements and a new construction
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Encryption switching protocols
- A conference key distribution system for the star configuration based on the discrete logarithm problem
- Cryptography from learning parity with noise
- Automata evaluation and text search protocols with simulation-based security
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Indistinguishable proofs of work or knowledge
- Signcryption schemes based on the Diffie-Hellman problem
- Identification schemes from key encapsulation mechanisms
- Identity-based deterministic signature scheme without forking-lemma
- CRT-based outsourcing algorithms for modular exponentiations
- Subliminal hash channels
- Authenticated group key agreement protocol without pairing
- Leakage-resilient signatures
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Information-theoretic secure verifiable secret sharing over RSA modulus
- Hidden Collisions on DSS
- An Efficient Strong Key-Insulated Signature Scheme and Its Application
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Unifying Zero-Knowledge Proofs of Knowledge
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Threshold signature scheme with threshold verification based on multivariate linear polynomial
- A public key cryptosystem based on three new provable problems
- scientific article; zbMATH DE number 1303139 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210171)
