Unprovable Security of Perfect NIZK and Non-Interactive Non-Malleable Commitments

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-36594-2_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Non-Malleable Secret Sharing

2018English

Continuously Non-Malleable Codes With Split-State Refresh

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Non-Malleable Codes for Partial Functions With Manipulation Detection

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

An Efficient Adaptive-Deniable-Concurrent Non-Malleable Commitment Scheme

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2011English

Non-Interactive Key Exchange

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions

2017English

Concurrent Security and Non-Malleability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Sport Marketing and Non Profit Marketing - Perfect Together

International Review on Public and Nonprofit Marketing
MarketingEconomicsEconometrics
2015English

Efficient Non-Interactive Secure Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy