Theory of cryptography : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings
Bibliographische Detailangaben
- Titel
- Theory of cryptography Part I : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings
- verantwortlich
- ; ;
- In
- Part I :
- Schriftenreihe
- Lecture notes in computer science ; 9985
- veröffentlicht
- Erscheinungsjahr
- 2016
- Teil von
- Lecture notes in computer science ; ; 9985.
- Teil von
- LNCS sublibrary.
- Medientyp
- E-Book
- Datenquelle
- British National Bibliography
- Tags
- Tag hinzufügen
Zugang
Für diesen Titel können wir derzeit leider keine weiteren Informationen zur Verfügbarkeit bereitstellen.
- Details Klicken Sie hier, um den Inhalt der Registerkarte zu laden.
- Standorte Klicken Sie hier, um den Inhalt der Registerkarte zu laden.
- Inhaltsangabe Klicken Sie hier, um den Inhalt der Registerkarte zu laden.
- Internformat Klicken Sie hier, um den Inhalt der Registerkarte zu laden.
Inhaltsangabe:
- TCC Test-of-Time Award
- From Indifferentiability to Constructive Cryptography (and Back)
- Foundations
- Fast Pseudorandom Functions Based on Expander Graphs
- 3-Message Zero Knowledge Against Human Ignorance
- The GGM Function Family is a Weakly One-Way Family of Functions
- On the (In)security of SNARKs in the Presence of Oracles
- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
- Simulating Auxiliary Inputs, Revisited
- Unconditional Security
- Pseudoentropy: Lower-bounds for Chain rules and Transformations
- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement
- Simultaneous Secrecy and Reliability Amplification for a General Channel Model
- Proof of Space from Stacked Expanders
- Perfectly Secure Message Transmission in Two Rounds
- Foundations of Multi-Party Protocols
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Binary AMD Circuits from Secure Multiparty Computation
- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity
- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions
- Adaptive Security of Yao's Garbled Circuits
- Round Complexity and Efficiency of Multi-Party Computation
- Efficient Secure Multiparty Computation with Identifiable Abort
- Secure Multiparty RAM Computation in Constant Rounds
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
- More Efficient Constant-Round Multi-Party Computation from BMR and SHE
- Cross & Clean: Amortized Garbled Circuits With Constant Overhead
- Differential Privacy
- Separating Computational and Statistical Differential Privacy in the Client-Server Model
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
- Strong Hardness of Privacy from Weak Traitor Tracing.