51 results on '"Michael Backes"'
Search Results
2. Ring Signatures: Logarithmic-Size, No Setup - from Standard Assumptions.
3. Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup.
4. How to wrap it up - A formally verified proposal for the use of authenticated wrapping in PKCS\#11.
5. Accountability in Security Protocols.
6. Membership Privacy for Fully Dynamic Group Signatures.
7. Signatures with Flexible Public Key: A Unified Approach to Privacy-Preserving Signatures (Full Version).
8. Anonymous RAM.
9. Oblivion: Mitigating Privacy Leaks by Controlling the Discoverability of Online Information.
10. Nearly Practical and Privacy-Preserving Proofs on Authenticated Data.
11. Operational Signature Schemes.
12. AnoA: A Framework For Analyzing Anonymous Communication Protocols.
13. (Nothing else) MATor(s): Monitoring the Anonymity of Tor's Path Selection.
14. Asynchronous MPC with t<n/2 Using Non-equivocation.
15. TUC: Time-sensitive and Modular Analysis of Anonymous Communication.
16. Highly Controlled, Fine-grained Delegation of Signing Capabilities.
17. Differential Indistinguishability for Cryptographic Primitives with Imperfect Randomness.
18. Verifiable Delegation of Computation on Outsourced Data.
19. Differentially Private Smart Metering with Battery Recharging.
20. Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification.
21. Computational Soundness without Protocol Restrictions.
22. Asynchronous Computational VSS with Reduced Communication Complexity.
23. Computational Verifiable Secret Sharing Revisited.
24. Provably Secure and Practical Onion Routing.
25. Computationally Sound Verification of Source Code.
26. CoSP: A General Framework For Computational Soundness Proofs.
27. Formally Bounding the Side-Channel Leakage in Unknown-Message Attacks.
28. Computational soundness of symbolic zero-knowledge proofs.
29. On the Security of Protocols with Logarithmic Communication Complexity.
30. On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.
31. Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol.
32. Computationally Sound Secrecy Proofs by Mechanized Flow Analysis.
33. Limits of the Reactive Simulatability/UC of Dolev-Yao Models with Hashes.
34. Conditional Reactive Simulatability.
35. Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos.
36. Cryptographically Sound Theorem Proving.
37. On the Necessity of Rewinding in Secure Multiparty Computation.
38. Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario.
39. Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles.
40. Secure Key-Updating for Lazy Revocation.
41. On Fairness in Simulatability-based Cryptographic Systems.
42. Limits of the Cryptographic Realization of Dolev-Yao-style XOR.
43. Relating Symbolic and Cryptographic Secrecy.
44. Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library.
45. The Reactive Simulatability (RSIM) Framework for Asynchronous Systems.
46. Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions.
47. How to Break and Repair a Universally Composable Signature Functionality.
48. Public-Key Steganography with Active Attacks.
49. A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol.
50. A Universally Composable Cryptographic Library.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.