scientific article
From MaRDI portal
Publication:4035712
zbMath0763.94015MaRDI QIDQ4035712
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources ⋮ Secure Computation, I/O-Efficient Algorithms and Distributed Signatures ⋮ Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Improvement of identity-based threshold proxy signature scheme with known signers ⋮ A threshold scheme under peer-to-peer network ⋮ Information-theoretic secure verifiable secret sharing over RSA modulus ⋮ Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ A property-based attestation protocol for TCM ⋮ UC Updatable Databases and Applications ⋮ Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing ⋮ Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function ⋮ Compact and Efficient UC Commitments Under Atomic-Exchanges ⋮ Beating the Birthday Paradox in Dining Cryptographer Networks ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ How to deal with malicious users in privacy‐preserving distributed data mining ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Privacy-preserving blueprints ⋮ Private polynomial commitments and applications to MPC ⋮ Dynamic and Verifiable Hierarchical Secret Sharing ⋮ An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Revisiting BBS signatures ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ Practical Threshold Signatures Without Random Oracles ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ Identity-based encryption in DDH hard groups ⋮ Multimodal private signatures ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ Nearly optimal property preserving hashing ⋮ Two faces of blindness ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ An efficient publicly verifiable and proactive secret sharing scheme ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Count me in! Extendability for threshold ring signatures ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Revisiting group oriented secret sharing schemes ⋮ Trustworthy sealed-bid auction with low communication cost atop blockchain ⋮ Black-box anonymous commit-and-prove ⋮ Anonymous tokens with stronger metadata bit hiding from algebraic MACs ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Proofs for inner pairing products and applications ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ Efficient Disjointness Tests for Private Datasets ⋮ An Efficient and Provably Secure Private Polynomial Evaluation Scheme ⋮ On actively secure fine-grained access structures from isogeny assumptions ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ UNCONDITIONALLY SECURE FAIR (t-n)-SECRET SHARING SCHEME ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ PointProofs, revisited ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Simplified Submission of Inputs to Protocols ⋮ Property-Based Attestation without a Trusted Third Party ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ S-money: virtual tokens for a relativistic economy ⋮ Efficient non-malleable commitment schemes ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Chameleon-Hashes with Ephemeral Trapdoors ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Scalable Multi-party Private Set-Intersection ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Efficient non-malleable commitment schemes ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor ⋮ Fair Traceable Multi-Group Signatures ⋮ Efficient Simultaneous Broadcast ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ On the exact round complexity of secure three-party computation ⋮ Zero-Knowledge Sets with Short Proofs ⋮ 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 ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ Unifying Zero-Knowledge Proofs of Knowledge ⋮ Public Verifiability from Pairings in Secret Sharing Schemes ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ Publicly Verifiable Secret Sharing for Cloud-Based Key Management ⋮ A Federated Digital Identity Management Approach for Business Processes ⋮ How to obtain full privacy in auctions ⋮ Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ Unnamed Item ⋮ On Application of Elliptic Curves in Some Electronic Voting Protocols ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Decentralized Anonymous Micropayments ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Practical Schnorr threshold signatures without the algebraic group model
This page was built for publication:
