Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428115
DOI10.1007/b11817zbMath1122.94357WikidataQ56235047 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
94A60: Cryptography
Related Items
Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS, New Constructions and Applications of Trapdoor DDH Groups, 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 with Decentralized Tracing, Group-Based Source-Destination Verifiable Encryption with Blacklist Checking, Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications, Adaptive Partitioning, Group Encryption, Efficient Simultaneous Broadcast, Online-Untransferable Signatures, Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures, One-Shot Verifiable Encryption from Lattices, Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin, Augmented Oblivious Polynomial Evaluation Protocol and Its Applications, Group signatures and more from isogenies and lattices: generic, simple, and efficient, 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, Universally composable \(\varSigma \)-protocols in the global random-oracle model, Rate-limited secure function evaluation, Smooth projective hashing and two-message oblivious transfer, Lossy trapdoor functions from homomorphic reproducible encryption, Fair exchange of valuable information: a generalised framework, EPID with malicious revocation, Time-selective convertible undeniable signatures with short conversion receipts, Practical fully secure unrestricted inner product functional encryption modulo \(p\), On the impossibility of structure-preserving deterministic primitives, All-but-many encryption, Practical chosen ciphertext secure encryption from factoring, Secure and efficient multiparty private set intersection cardinality, Bandwidth-efficient threshold EC-DSA, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Two-sided malicious security for private intersection-sum with cardinality, Coin-based multi-party fair exchange, Generic plaintext equality and inequality proofs, 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, Fair signature exchange via delegation on ubiquitous networks, A reduction of security notions in designated confirmer signatures, A secure scalar product protocol against malicious adversaries, Improving Practical UC-Secure Commitments Based on the DDH Assumption, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function, Dining Cryptographers with 0.924 Verifiable Collision Resolution, Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter, New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness, A General, Flexible and Efficient Proof of Inclusion and Exclusion, Towards Restricting Plaintext Space in Public Key Encryption, UC-secure and Contributory Password-Authenticated Group Key Exchange, Ambiguous One-Move Nominative Signature Without Random Oracles, Efficiency Limitations for Σ-Protocols for Group Homomorphisms, Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility, Fair Traceable Multi-Group Signatures, 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, Fair Threshold Decryption with Semi-Trusted Third Parties
