Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428115
DOI10.1007/b11817zbMath1122.94357OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428115
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Related Items (62)
EPID with malicious revocation ⋮ Group Signatures with Decentralized Tracing ⋮ Group-Based Source-Destination Verifiable Encryption with Blacklist Checking ⋮ A reduction of security notions in designated confirmer signatures ⋮ UC-secure and Contributory Password-Authenticated Group Key Exchange ⋮ Generic plaintext equality and inequality proofs ⋮ A secure scalar product protocol against malicious adversaries ⋮ Rate-limited secure function evaluation ⋮ Ambiguous One-Move Nominative Signature Without Random Oracles ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function ⋮ Privacy-preserving blueprints ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Dining Cryptographers with 0.924 Verifiable Collision Resolution ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Fair exchange of valuable information: a generalised framework ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Group Encryption ⋮ All-but-many encryption ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ Fair signature exchange via delegation on ubiquitous networks ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm ⋮ 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 ⋮ Time-selective convertible undeniable signatures with short conversion receipts ⋮ Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Fair Traceable Multi-Group Signatures ⋮ Efficient Simultaneous Broadcast ⋮ Online-Untransferable Signatures ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ On the Portability of Generalized Schnorr Proofs ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ Towards Restricting Plaintext Space in Public Key Encryption ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures ⋮ Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications ⋮ Adaptive Partitioning ⋮ Coin-based multi-party fair exchange
This page was built for publication: Advances in Cryptology - CRYPTO 2003
