The following pages link to (Q4394211):
Displaying 32 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Two-server password-only authenticated key exchange (Q414937) (← links)
- Several cryptographic applications of \(\Sigma\)-protocol (Q473026) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
- Logarithmic-size ring signatures with tight security from the DDH assumption (Q2167754) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Anonymous Authentication with Spread Revelation (Q2920292) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- Towards Restricting Plaintext Space in Public Key Encryption (Q3098005) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage (Q3460114) (← links)
- Unifying Zero-Knowledge Proofs of Knowledge (Q3637145) (← links)
- Cryptographic Voting — A Gentle Introduction (Q5253589) (← links)
- Extended security arguments for signature schemes (Q5963366) (← links)
- An accurate, scalable and verifiable protocol for federated differentially private averaging (Q6097108) (← links)
