scientific article; zbMATH DE number 4191111
From MaRDI portal
Publication:3210171
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- EPID with malicious revocation
- SoK: how (not) to design and implement post-quantum cryptography
- SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
- Adaptively secure distributed public-key systems.
- Intermundium-DL: assessing the resilience of current schemes to discrete-log-computation attacks on public parameters
- : a unified framework for computational verifiable secret sharing
- Buffing threshold signature schemes
- One bit to rule them all -- imperfect randomness harms lattice signatures
- Identity-based signature and extended forking algorithm in the multivariate quadratic setting
- Random oracles and non-uniformity
- Information-theoretic secure verifiable secret sharing over RSA modulus
- Untangling the security of Kilian's protocol: upper and lower bounds
- One-more unforgeability for multi- and threshold signatures
- Updatable privacy-preserving blueprints
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
- An efficient eCK secure identity based two party authenticated key agreement scheme with security against active adversaries
- FROST: Flexible round-optimized Schnorr threshold signatures
- Scalable multi-party private set-intersection
- A probabilistic analysis on a lattice attack against DSA
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- Fast two-party signature for upgrading ECDSA to two-party scenario easily
- An interactive identification scheme based on discrete logarithms and factoring
- Unifying Zero-Knowledge Proofs of Knowledge
- Security properties of one ``short signature scheme
- Compute, but verify: efficient multiparty computation over authenticated inputs
- Anamorphic authenticated key exchange: double key distribution under surveillance
- Predicate aggregate signatures and applications
- Threshold structure-preserving signatures
- Mild asymmetric message franking: illegal-messages-only and retrospective content moderation
- Adaptor signatures: new security definition and a generic construction for NP relations
- Digital signatures with outsourced hashing
- Threshold signature scheme with threshold verification based on multivariate linear polynomial
- Practical algorithm substitution attack on extractable signatures
- Access with pseudonyms
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Secure parameterized pattern matching
- Identity-based deterministic signature scheme without forking-lemma
- An Efficient Strong Key-Insulated Signature Scheme and Its Application
- Anonymous tokens with stronger metadata bit hiding from algebraic MACs
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Lattice-based cryptography: a survey
- Improved low-computation partially blind signatures.
- Subset-optimized BLS multi-signature with key aggregation
- SoK: signatures with randomizable keys
- Proactive refresh for accountable threshold signatures
- Short paper: naysayer proofs
- On removing rejection conditions in practical lattice-based signatures
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols
- Streebog as a random oracle
- Proof of necessary work: succinct state verification with fairness guarantees
- Rogue-instance security for batch knowledge proofs
- EPG-representations with Small Grid-Size
- Security proofs for identity-based identification and signature schemes
- scientific article; zbMATH DE number 1848385 (Why is no real title available?)
- Public key compression for constrained linear signature schemes
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Bootstrapping for approximate homomorphic encryption
- Dynamic-FROST: Schnorr threshold signatures with a flexible committee
- Optimal forgeries against polynomial-based MACs and GCM
- Indistinguishable proofs of work or knowledge
- Hidden Collisions on DSS
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Explicit formulas of the addition law on the elliptic curve over a special nonlocal ring
- A conference key distribution system for the star configuration based on the discrete logarithm problem
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
- Speeding up exponentiation using an untrusted computational resource
- Automata evaluation and text search protocols with simulation-based security
- A compressed \(\varSigma \)-protocol theory for lattices
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- IND-CCA secure encryption based on a Zheng-Seberry scheme
- Efficient set operations in the presence of malicious adversaries
- On the Menezes-Teske-Weng conjecture
- Efficient NIZK arguments with straight-line simulation and extraction
- Threshold signatures with private accountability
- Secure implementation of digital signature using semi-trusted computational core
- Efficient signature generation by smart cards
- Improved OR-composition of sigma-protocols
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- VSS from distributed ZK proofs and applications
- Cryptography based on number fields with large regulator
- Fuzzy signatures: relaxing requirements and a new construction
- Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system
- Non-interactive key exchange
- On tight security proofs for Schnorr signatures
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive zero-knowledge functional proofs
- Security reconsideration of the Huang-Wang nominative signature
- A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption
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)
