141 results on '"Paneth A"'
Search Results
2. Reusable Online-Efficient Commitments.
3. Batch Proofs Are Statistically Hiding.
4. Monotone-Policy Aggregate Signatures.
5. Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance.
6. Abstract 671: mTORC1 suppression in Paneth cells prevents tumors in a mouse model of intestinal cancer
7. Non-interactive Universal Arguments.
8. SNARGs for Monotone Policy Batch NP.
9. Incrementally Verifiable Computation via Rate-1 Batch Arguments.
10. Verifiable Private Information Retrieval.
11. PPAD is as Hard as LWE and Iterated Squaring.
12. Abstract 1704: High mobility group A1 chromatin remodeling protein expands the intestinal stem cell compartment and Paneth cell niche through Wnt/β-catenin signaling and Sox9
13. Batch Proofs Are Statistically Hiding
14. Weakly Extractable One-Way Functions.
15. Delegation with Updatable Unambiguous Proofs and PPAD-Hardness.
16. Weak zero-knowledge beyond the black-box barrier.
17. How to delegate computations publicly.
18. Incrementally Verifiable Computation via Incremental PCPs.
19. On Round Optimal Statistical Zero Knowledge Arguments.
20. Multi-collision resistance: a paradigm for keyless hash functions.
21. A Multi-Method Approach to Capture Quality of Collaborative Group Engagement
22. On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments.
23. On Removing Graded Encodings from Functional Encryption.
24. Time-Lock Puzzles from Randomized Encodings.
25. 3-Message Zero Knowledge Against Human Ignorance.
26. Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.
27. Delegating RAM Computations.
28. Reusable Fuzzy Extractors for Low-Entropy Distributions.
29. On the Cryptographic Hardness of Finding a Nash Equilibrium.
30. On Obfuscation with Random Oracles.
31. ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation.
32. On the existence of extractable one-way functions.
33. Verifiable Set Operations over Outsourced Databases.
34. Obfuscation for Evasive Functions.
35. Protecting Obfuscation against Algebraic Attacks.
36. The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
37. On Virtual Grey Box Obfuscation for General Circuits.
38. Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.
39. On the impossibility of approximate obfuscation and applications to resettable cryptography.
40. Public-Coin Concurrent Zero-Knowledge in the Global Hash Model.
41. Succinct Non-interactive Arguments via Linear Interactive Proofs.
42. On the Achievability of Simulation-Based Security for Functional Encryption.
43. From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique.
44. Point Obfuscation and 3-Round Zero-Knowledge.
45. Incrementally Verifiable Computation via Rate-1 Batch Arguments
46. Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.
47. Organizing Data With Temporal and Spatial References.
48. Weak zero-knowledge beyond the black-box barrier
49. How to delegate computations publicly
50. Multi-collision resistance: a paradigm for keyless hash functions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.