UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Indistinguishability obfuscation from well-founded assumptions

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.60-73

2021

Volltextzugriff (PDF)

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Journal of cryptology, 2013-04, Vol.26 (2), p.191-224

2013

Volltextzugriff (PDF)

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

Advances in Cryptology – CRYPTO 2016, p.629-658

Volltextzugriff (PDF)

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification

Advances in Cryptology – EUROCRYPT 2021, p.97-126

Volltextzugriff (PDF)

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

SIAM journal on computing, 2016-01, Vol.45 (3), p.882-929

2016

Volltextzugriff (PDF)

New Techniques for Noninteractive Zero-Knowledge

Journal of the ACM, 2012-06, Vol.59 (3), p.1-35

2012

Volltextzugriff (PDF)

Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation

Journal of cryptology, 2024, Vol.37 (1), Article 1

2024

Volltextzugriff (PDF)

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Journal of cryptology, 2015-10, Vol.28 (4), p.820-843

2015

Volltextzugriff (PDF)

Founding Cryptography on Oblivious Transfer – Efficiently

Advances in Cryptology – CRYPTO 2008, Vol.5157, p.572-591

Volltextzugriff (PDF)

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles

Journal of cryptology, 2013-04, Vol.26 (2), p.340-373

2013

Volltextzugriff (PDF)

How to Use Indistinguishability Obfuscation: Deniable Encryption, and More

SIAM journal on computing, 2021-01, Vol.50 (3), p.857-908

2021

Volltextzugriff (PDF)

Efficient Noninteractive Proof Systems for Bilinear Groups

SIAM journal on computing, 2012-01, Vol.41 (5), p.1193-1232

2012

Volltextzugriff (PDF)

Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003. Proceedings

2003

Volltextzugriff (PDF)

Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)

SIAM journal on computing, 2022-01, Vol.51 (2), p.STOC17-i-STOC17-ii

2022

Volltextzugriff (PDF)

The Power of a Pebble: Exploring and Mapping Directed Graphs

Information and computation, 2002-07, Vol.176 (1), p.1-21

2002

Volltextzugriff (PDF)

Statistical ZAP Arguments

Advances in Cryptology – EUROCRYPT 2020, p.642-667

Volltextzugriff (PDF)

ZERO-KNOWLEDGE PROOFS FROM SECURE MULTIPARTY COMPUTATION

SIAM journal on computing, 2009-01, Vol.39 (3), p.1121-1121

2009

Volltextzugriff (PDF)

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

Advances in Cryptology – EUROCRYPT 2017, p.247-277

Volltextzugriff (PDF)

Witness Semantic Security

Advances in Cryptology – EUROCRYPT 2024, p.155-184

Volltextzugriff (PDF)

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.1243-1256

2023

Volltextzugriff (PDF)

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption

Advances in Cryptology – EUROCRYPT 2017, p.91-121

Volltextzugriff (PDF)

Efficient NIZKs from LWE via Polynomial Reconstruction and “MPC in the Head”

Advances in Cryptology – ASIACRYPT 2022, p.496-521

Volltextzugriff (PDF)

Non-Interactive Publicly-Verifiable Delegation of Committed Programs

Public-Key Cryptography – PKC 2023, p.575-605

Volltextzugriff (PDF)

Round Optimal Concurrent MPC via Strong Simulation

Theory of Cryptography, p.743-775

Volltextzugriff (PDF)

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

Advances in Cryptology – CRYPTO 2016, p.491-520

Volltextzugriff (PDF)

1 – 25 von 85

Suche als RSS-Feed

Aktive Filter

ThemaMathematics

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(72)
Mit Volltextzugriff
(84)

Publikationsform

Sprache

Englisch
(85)
Japanisch
(10)

Erscheinungsjahr

n.n

Zeitschrift / Serie

3 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Indistinguishability obfuscation from well-founded assumptions

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

New Techniques for Noninteractive Zero-Knowledge

Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Founding Cryptography on Oblivious Transfer – Efficiently

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles

How to Use Indistinguishability Obfuscation: Deniable Encryption, and More

Efficient Noninteractive Proof Systems for Bilinear Groups

Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)

The Power of a Pebble: Exploring and Mapping Directed Graphs

Statistical ZAP Arguments

ZERO-KNOWLEDGE PROOFS FROM SECURE MULTIPARTY COMPUTATION

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

Witness Semantic Security

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption

Efficient NIZKs from LWE via Polynomial Reconstruction and “MPC in the Head”

Non-Interactive Publicly-Verifiable Delegation of Committed Programs

Round Optimal Concurrent MPC via Strong Simulation

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

Aktive Filter

Suchergebnisse filtern