Pages that link to "Item:Q5711583"
From MaRDI portal
The following pages link to Public Key Cryptography - PKC 2005 (Q5711583):
Displayed 48 items.
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Provably secure group key management scheme based on proxy re-encryption with constant public bulletin size and key derivation time (Q1628270) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Implementing secure reporting of sexual misconduct -- revisiting WhoToo (Q2146102) (← links)
- PoSAT: proof-of-work availability and unpredictability, without the work (Q2147235) (← links)
- Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves (Q2191198) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Short signatures without random oracles and the SDH assumption in bilinear groups (Q2425530) (← links)
- Public-key generation with verifiable randomness (Q2692338) (← links)
- A combinatorial approach to quantum random functions (Q2692397) (← links)
- Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys (Q2827708) (← links)
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions (Q2953792) (← links)
- Sub-linear Size Traceable Ring Signatures without Random Oracles (Q3073719) (← links)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy (Q3092348) (← links)
- Unforgeability of Re-Encryption Keys against Collusion Attack in Proxy Re-Encryption (Q3098009) (← links)
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem (Q3392897) (← links)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← links)
- Security Analysis of the Strong Diffie-Hellman Problem (Q3593084) (← links)
- Practical Identity-Based Encryption Without Random Oracles (Q3593111) (← links)
- Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
- Verifiable Random Functions from Identity-Based Key Encapsulation (Q3627457) (← links)
- A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication (Q4933222) (← links)
- Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function (Q5267798) (← links)
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption (Q5445463) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- Explainable arguments (Q6045191) (← links)
- Anonymous tokens with public metadata and applications to private contact tracing (Q6045198) (← links)
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey (Q6101318) (← links)
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable (Q6113958) (← links)
- Logarithmic-size (linkable) threshold ring signatures in the plain model (Q6113965) (← links)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions (Q6162383) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)