Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2572551486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal switching circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Prove Knowledge of Small Secrets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Amortized Complexity of Zero-Knowledge Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the amortized complexity of zero-knowledge protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conductors and constant-degree lossless expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision-Free Hashing from Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWIFFT: A Modest Proposal for FFT Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Identification Schemes Secure Under Active Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:44, 13 July 2024

scientific article; zbMATH DE number 6729675
Language Label Description Also known as
English
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
scientific article; zbMATH DE number 6729675

    Statements

    Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references

    Identifiers